{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:35:28Z","timestamp":1648956928830},"reference-count":15,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.252.14","type":"journal-article","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T12:51:54Z","timestamp":1503319914000},"page":"128-142","source":"Crossref","is-referenced-by-count":0,"title":["Input-Driven Double-Head Pushdown Automata"],"prefix":"10.4204","volume":"252","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen"}]}],"member":"2720","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"key":"Alur:2009:answ","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518","article-title":"Adding nesting structure to words","volume":"56","author":"Alur","year":"2009","journal-title":"J. ACM"},{"key":"bensch:2012:idsa:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-33475-7_3","article-title":"Input-Driven Stack Automata","volume-title":"Theoretical Computer Science (TCS 2012)","volume":"7604","author":"Bensch","year":"2012"},{"key":"braunmuehl:1983:idlrlog","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","article-title":"Input-Driven Languages are Recognized in ologn Space","volume-title":"Fundamentals of Computation Theory (FCT 1983)","volume":"158","author":"von Braunm\u00fchl","year":"1983"},{"issue":"1","key":"Buntrock:1998:gcslcrl:art","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2681","article-title":"Growing Context-Sensitive Languages and Church-Rosser Languages","volume":"141","author":"Buntrock","year":"1998","journal-title":"Inform. Comput."},{"key":"carotenuto:2016:omsvpda","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.08.012","article-title":"Ordered multi-stack visibly pushdown automata","volume":"656","author":"Carotenuto","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"dymond:1988:idllognd","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(88)90148-2","article-title":"Input-Driven Languages are in ologn Depth","volume":"26","author":"Dymond","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"harrison:1968:mtmhpda","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multi-Tape and Multi-Head Pushdown Automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Inform. Control"},{"key":"Hopcroft:1979:itatlc:book","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"kutrib:2015:idqaftdcp","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2015.01.012","article-title":"Deterministic Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties","volume":"578","author":"Kutrib","year":"2015","journal-title":"Theoret. Comput. Sci."},{"key":"McNaughton:1988:crtsfl","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","article-title":"Church-Rosser Thue Systems and Formal Languages","volume":"35","author":"McNaughton","year":"1988","journal-title":"J. ACM"},{"key":"mehlhorn:1980:pmradcflr","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","article-title":"Pebbling Moutain Ranges and its Application of DCFL-Recognition","volume-title":"International Colloquium on Automata, Languages and Programming (ICALP 1980)","volume":"85","author":"Mehlhorn","year":"1980"},{"key":"nagy:2012:cothfall","first-page":"89","article-title":"A class of 2-head finite automata for linear languages","author":"Nagy","year":"2012","journal-title":"Triangle 8, (Languages, Mathematical Approaches)"},{"key":"Nagy:2015:afothpa","series-title":"books@ocg.at","first-page":"177","article-title":"A family of two-head pushdown automata","volume-title":"Non-Classical Models of Automata and Applications (NCMA 2015)","volume":"318","author":"Nagy","year":"2015"},{"key":"Niemann:2005:crldvgcsl","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.09.003","article-title":"The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages","volume":"197","author":"Niemann","year":"2005","journal-title":"Inform. Comput."},{"key":"rosenberg:1967:mrlcfl","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0019-9958(67)80006-8","article-title":"A Machine Realization of the Linear Context-Free Languages","volume":"10","author":"Rosenberg","year":"1967","journal-title":"Inform. Control"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T06:33:23Z","timestamp":1503470003000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1708.06464v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":15,"URL":"https:\/\/doi.org\/10.4204\/eptcs.252.14","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,21]]}}}