{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:19Z","timestamp":1770994039872,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1016\/j.ic.2022.104938","type":"journal-article","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T01:57:03Z","timestamp":1656554223000},"page":"104938","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"PA","title":["Converting nondeterministic two-way automata into small deterministic linear-time machines"],"prefix":"10.1016","volume":"289","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1630-3404","authenticated-orcid":false,"given":"Bruno","family":"Guillon","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7509-7842","authenticated-orcid":false,"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-7163-4965","authenticated-orcid":false,"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-4866-5709","authenticated-orcid":false,"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2022.104938_br0010","series-title":"Language and Automata Theory and Applications - 8th International Conference","first-page":"553","article-title":"Weight-reducing Hennie machines and their descriptional complexity","author":"Pr\u016f\u0161a","year":"2014"},{"key":"10.1016\/j.ic.2022.104938_br0020","series-title":"Developments in Language Theory - 22nd International Conference","first-page":"366","article-title":"Two-way automata and one-tape machines - read only versus linear time","volume":"vol. 11088","author":"Guillon","year":"2018"},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0030","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0040","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The reduction of two-way automata to one-way automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"10.1016\/j.ic.2022.104938_br0050","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ic.2010.01.002","article-title":"More concise representation of regular languages by automata and regular expressions","volume":"208","author":"Geffert","year":"2010","journal-title":"Inf. Comput."},{"issue":"8","key":"10.1016\/j.ic.2022.104938_br0060","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1142\/S0129054120420071","article-title":"Non-self-embedding grammars, constant-height pushdown automata, and limited automata","volume":"31","author":"Guillon","year":"2020","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.ic.2022.104938_br0070","series-title":"Computational Complexity","author":"Wagner","year":"1986"},{"issue":"07","key":"10.1016\/j.ic.2022.104938_br0080","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1142\/S0129054114400140","article-title":"Limited automata and regular languages","volume":"25","author":"Pighizzini","year":"2014","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.ic.2022.104938_br0090","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ic.2019.01.002","article-title":"Limited automata and unary languages","volume":"266","author":"Pighizzini","year":"2019","journal-title":"Inf. Comput."},{"issue":"6","key":"10.1016\/j.ic.2022.104938_br0100","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inf. Control"},{"key":"10.1016\/j.ic.2022.104938_br0110","author":"Guillon"},{"key":"10.1016\/j.ic.2022.104938_br0120","first-page":"33","article-title":"Turing machine computations with logarithmic delay","volume":"3","author":"Trakhtenbrot","year":"1964","journal-title":"Algebra Log."},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0130","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321450.321464","article-title":"Computational complexity of one-tape Turing machine computations","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.ic.2022.104938_br0140","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(91)90054-6","article-title":"An NP-complete language accepted in linear time by a one-tape Turing machine","volume":"85","author":"Michel","year":"1991","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ic.2022.104938_br0150","first-page":"107","article-title":"Nondeterministic one-tape off-line Turing machines","volume":"14","author":"Pighizzini","year":"2009","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"10.1016\/j.ic.2022.104938_br0160","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.tcs.2009.08.031","article-title":"Theory of one-tape linear-time Turing machines","volume":"411","author":"Tadaki","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2022.104938_br0170","series-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","first-page":"275","article-title":"Nondeterminism and the size of two way finite automata","author":"Sakoda","year":"1978"},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0180","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","article-title":"Lower bounds on the size of sweeping automata","volume":"21","author":"Sipser","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ic.2022.104938_br0190","series-title":"Automata, Languages and Programming, 30th International Colloquium","first-page":"439","article-title":"Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser's separation","author":"Hromkovic","year":"2003"},{"key":"10.1016\/j.ic.2022.104938_br0200","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.ic.2012.11.001","article-title":"Nondeterminism is essential in small two-way finite automata with few reversals","volume":"222","author":"Kapoutsis","year":"2013","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"10.1016\/j.ic.2022.104938_br0210","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","article-title":"Converting two-way nondeterministic unary automata into simpler automata","volume":"295","author":"Geffert","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2022.104938_br0220","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ic.2014.08.009","article-title":"Two-way automata making choices only at the endmarkers","volume":"239","author":"Geffert","year":"2014","journal-title":"Inf. Comput."},{"issue":"4","key":"10.1016\/j.ic.2022.104938_br0230","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/s00224-014-9560-x","article-title":"Two-way automata characterizations of L\/poly versus NL","volume":"56","author":"Kapoutsis","year":"2015","journal-title":"Theory Comput. Syst."},{"issue":"2\u20133","key":"10.1016\/j.ic.2022.104938_br0240","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-2013-879","article-title":"Two-way finite automata: old and recent results","volume":"126","author":"Pighizzini","year":"2013","journal-title":"Fundam. Inform."},{"issue":"1","key":"10.1016\/j.ic.2022.104938_br0250","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0019-9958(70)80005-5","article-title":"Deterministic context-sensitive languages: Part II","volume":"17","author":"Walters","year":"1970","journal-title":"Inf. Control"},{"key":"10.1016\/j.ic.2022.104938_br0260","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0270","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Inf. Control"},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0280","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.ic.2022.104938_br0290","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s00224-013-9465-0","article-title":"Two-way automata versus logarithmic space","volume":"55","author":"Kapoutsis","year":"2014","journal-title":"Theory Comput. Syst."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0890540122000931?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0890540122000931?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T08:58:08Z","timestamp":1678006688000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540122000931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":29,"alternative-id":["S0890540122000931"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2022.104938","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2022,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Converting nondeterministic two-way automata into small deterministic linear-time machines","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2022.104938","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104938"}}