{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:29:45Z","timestamp":1648884585700},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0020-0190(94)00152-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"229-233","source":"Crossref","is-referenced-by-count":0,"title":["Refined simulation of multihead automata"],"prefix":"10.1016","volume":"52","author":[{"given":"H.","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00152-9_BIB1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(88)90004-9","article-title":"k + 1 heads are better than k for PDA","volume":"37","author":"Chrobak","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00152-9_BIB2","series-title":"Proc. IFIP Congress on Information Processing","first-page":"75","article-title":"Linear time simulation of deterministic two-way pushdown automata","author":"Cook","year":"1972"},{"key":"10.1016\/0020-0190(94)00152-9_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(88)90122-3","article-title":"Alternating multihead finite automata","volume":"61","author":"King","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(94)00152-9_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00152-9_BIB5","unstructured":"M. Ladermann, Simulating random access machines by counter-pushdown automata, in preparation."},{"key":"10.1016\/0020-0190(94)00152-9_BIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","article-title":"Alternating pushdown and stack automata","volume":"13","author":"Ladner","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00152-9_BIB7","first-page":"280","article-title":"Characterizations of time-bounded computations by limited primitive recursion","volume":"14","author":"Monien","year":"1974"},{"key":"10.1016\/0020-0190(94)00152-9_BIB8","series-title":"Bericht Nr. 8","article-title":"Komplexit\u00e4tsklassen von Automatenmodellen und beschr\u00e4nkte Rekursion","author":"Monien","year":"1974"},{"key":"10.1016\/0020-0190(94)00152-9_BIB9_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00263746","article-title":"Transformational methods and their application to complexity problems","volume":"6","author":"Monien","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(94)00152-9_BIB9_2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00271346","article-title":"Corrigendum","volume":"8","author":"Monien","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(94)00152-9_BIB10","series-title":"Formal Language Theory, Perspectives and Open Problems","first-page":"287","article-title":"The interface between language theory and complexity theory","author":"Monien","year":"1980"},{"key":"10.1016\/0020-0190(94)00152-9_BIB11","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0020-0190(81)90021-1","article-title":"An effective simulation of deterministic pushdown automata with many two-way and one-way heads","volume":"12","author":"Rytter","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00152-9_BIB12","first-page":"181","article-title":"Some remarks on multihead automata","volume":"11","author":"Sudborough","year":"1977","journal-title":"RAIRO"},{"key":"10.1016\/0020-0190(94)00152-9_BIB13","series-title":"Computational Complexity","author":"Wagner","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:27Z","timestamp":1555132947000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0020019094001529"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00152-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}