{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:07Z","timestamp":1725459067605},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051631X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013111","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T11:46:19Z","timestamp":1137066379000},"page":"56-64","source":"Crossref","is-referenced-by-count":1,"title":["Basic techniques for two-way finite automata"],"prefix":"10.1007","author":[{"given":"Jean-Camille","family":"Birget","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"56","volume":"34","author":"J. C. Birget","year":"1984","unstructured":"J. C. Birget, \"Arbitrary vs. regular semigroups\", J. Pure and Appl. Algebra, vol. 34 (1984) 56\u2013115.","journal-title":"J. Pure and Appl. Algebra"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"J. C. Birget, \"Concatenation of inputs in a two-way automaton,\" Theoret. Computer Sci. (to appear).","DOI":"10.1016\/0304-3975(89)90075-3"},{"key":"5_CR3","unstructured":"J. C. Birget, \"Two-way automaton computations\", RAIRO Informatique Th\u00e9orique (to appear)."},{"key":"5_CR4","unstructured":"J. C. Birget, \"proof of a conjecture of R.Kannan\" (to be submitted for publication)."},{"key":"5_CR5","unstructured":"P. Berman, A. Lingas, \"On the complexity of regular languages in terms of finite automata\", Report 304, Polish Academy of Sciences (1977)."},{"key":"5_CR6","unstructured":"J. Hopcroft, J. Ullman, \"Intro. to Automata Theory, Languages and Computation\", Addison-Wesley (1979)."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"R. Kannan, \"Alternation and the power of non-determinism\", Proc. 15th ACM Sym. on Theory of Computing (1983) 344\u2013364.","DOI":"10.1145\/800061.808764"},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1051\/ita\/1985190100711","volume":"19","author":"J. P. P\u00e9cuchet","year":"1985","unstructured":"J. P. P\u00e9cuchet, \"Automates boustrophedon, semigroupe de Birget et monoide inversif libre\", RAIRO Informatique Th\u00e9orique, vol. 19, 1 (1985) 71\u2013100.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"5_CR9","unstructured":"M.O. Rabin, \"Two-way automata\", Proc. Summer Inst. of Symbolic Logic, Cornell Univ. (1957), 366\u2013369."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"M.O.Rabin, D.Scott, \"Finite automata and their decision problems\", IBM J. Res. and Devel. (1959) 115\u2013125 and in E. F. Moore (ed.), \"Sequential Machines: Selected Papers\", Addison-Wesley (1964).","DOI":"10.1147\/rd.32.0114"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"M. Sipser, \"Lower bounds on the size of sweeping machines\", Proc. 11th ACM Sym. on Theory of Computing (1979) 360\u2013364.","DOI":"10.1145\/800135.804429"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"J. C. Shepherdson, \"The reduction of two-way automata to one-way automata\", IBM J. Res. and Devel. (1959) 198\u2013200, and in E. F. Moore (ed.), \"Sequential Machines: Selected Papers\", Addison-Wesley (1964).","DOI":"10.1147\/rd.32.0198"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"W. Sakoda, M. Sipser, \"Non-determinism and the size of two-way automata\", Proc. 10th ACM Sym. on Theory of Computing (1978) 275\u2013286.","DOI":"10.1145\/800133.804357"}],"container-title":["Lecture Notes in Computer Science","Formal Properties of Finite Automata and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T02:31:11Z","timestamp":1586658671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051631X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0013111","relation":{},"subject":[]}}