{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:40Z","timestamp":1759638400407},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0022-0000(92)90045-k","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"154-179","source":"Crossref","is-referenced-by-count":6,"title":["Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations"],"prefix":"10.1016","volume":"45","author":[{"given":"Jean-Camille","family":"Birget","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90045-K_BIB1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0022-4049(84)90056-2","article-title":"Arbitrary vs. regular semigroups","volume":"34","author":"Birget","year":"1984","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0022-0000(92)90045-K_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(89)90075-3","article-title":"Concatenation of inputs in a two-way automaton","volume":"63","author":"Birget","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90045-K_BIB3","series-title":"Proceedings, 21st ACM Symp. on Theory of Computing","first-page":"445","article-title":"Proof of a conjecture of R. Kannan","author":"Birget","year":"1989"},{"key":"10.1016\/0022-0000(92)90045-K_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","article-title":"On equations for regular languages, finite automata, and sequential networks","volume":"10","author":"Brzozowski","year":"1980","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/0022-0000(92)90045-K_BIB5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90045-K_BIB6","series-title":"Proceedings, IEEE 17th Annual Symp. on Foundations of computer Sci.","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(92)90045-K_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(92)90045-K_BIB8","series-title":"5th ACM STOC","first-page":"10","article-title":"On the time and tape complexity of languages","author":"Hunt","year":"1973"},{"key":"10.1016\/0022-0000(92)90045-K_BIB9","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":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90045-K_BIB10","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(92)90045-K_BIB11","series-title":"Proceedings, 15th ACM Symp. on Theory of Computing","first-page":"344","article-title":"Alternation and the power of non-determinism","author":"Kannan","year":"1983"},{"key":"10.1016\/0022-0000(92)90045-K_BIB12","series-title":"Proceedings, IEEE 17th Annual Symp. on Foundations of Computer Sci.","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0022-0000(92)90045-K_BIB13_1","series-title":"Proceedings, 19th IEEE Symp. on Foundations of Computer Sci.","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978"},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90045-K_BIB13_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"Ladner","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90045-K_BIB14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1051\/ita\/1985190100711","article-title":"Automates boustrophedon, semigroupe de Birget et monoide inversif libre","volume":"19","author":"P\u00e9cuchet","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0022-0000(92)90045-K_BIB15","series-title":"Proceedings, Summer Inst. of Symbolic Logic","article-title":"Two-way automata","author":"Rabin","year":"1957"},{"key":"10.1016\/0022-0000(92)90045-K_BIB16","series-title":"Proceedings, 11th ACM Symp. on Theory of Computing","first-page":"360","article-title":"Lower bounds on the size of sweeping machines","author":"Sipser","year":"1979"},{"key":"10.1016\/0022-0000(92)90045-K_BIB17_1","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","author":"Shepherdson","year":"1959","journal-title":"IBM J. Res. Devel."},{"key":"10.1016\/0022-0000(92)90045-K_BIB17_2","series-title":"Sequential Machines: Selected Papers","author":"Shepherdson","year":"1964"},{"key":"10.1016\/0022-0000(92)90045-K_BIB18","series-title":"Proceedings, 10th ACM Symp. on Theory of Computing","first-page":"275","article-title":"Non-determinism and the size of two-way automata","author":"Sakoda","year":"1978"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290045K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290045K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:24Z","timestamp":1550307444000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290045K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002200009290045K"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90045-k","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}