{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:40Z","timestamp":1725663580906},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:40Z","timestamp":1330207360000},"page":"109-119","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-way reading on words"],"prefix":"10.1007","author":[{"given":"M.","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"7_CR1","unstructured":"M.Anselmo, Automates et codes ZigZag, to appear in RAIRO Inform. Th\u00e9or and tech. report LITP no 88\u201374, Nov. 1988."},{"key":"7_CR2","unstructured":"M. Anselmo, Sur les codes zig-zag et leur d\u00e9cidabilit\u00e9, to appear in Theoret. Comput. Sci.; and tech. report LITP no 8972-36, Mai 1989"},{"key":"7_CR3","unstructured":"M. Anselmo, Sur la rationalit\u00e9 de la s\u00e9rie des zig-zag et des s\u00e9ries reconnues par les automates bilat\u00e8res, tech. report LITP no 89\u201361, July 1989"},{"key":"7_CR4","unstructured":"M. Anselmo, The zig-zag power-series: a two-way version of the star operator, to appear in Theoret. Comput. Sci., special issue"},{"key":"7_CR5","unstructured":"M. Anselmo, Two-way automata with multiplicity, Proceed. ICALP 90"},{"key":"#cr-split#-7_CR6.1","unstructured":"M. Anselmo, Automates bilat\u00e8res et codes zig-zag, Ph. D. thesis, Univ. Paris 7 (1990)"},{"key":"#cr-split#-7_CR6.2","unstructured":"and tech. report LITP no 90-27, Mars 1990"},{"key":"7_CR7","volume-title":"Theory of codes","author":"J. Berstel","year":"1985","unstructured":"J. Berstel \u2014 D. Perrin, Theory of codes, (Academic Press, New York, 1985)."},{"key":"7_CR8","volume-title":"Les s\u00e9ries rationnelles et leur languages","author":"J. Berstel","year":"1984","unstructured":"J. Berstel \u2014 C. Reutenauer, Les s\u00e9ries rationnelles et leur languages, (Masson, Paris, 1984)"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(89)90075-3","volume":"63","author":"J.C. Birget","year":"1989","unstructured":"J.C. Birget, Concatenations of Inputs in a Two-way Automaton, Theoret. Comput. Sci.\n63 (1989) 141\u2013156; and tech. report no46, Dept. of Computer Science, Univ. of Nebraska, Lincoln, April 1987.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR10","unstructured":"J.C. Birget, Two-way Automaton Computations, to appear in RAIRO Inform. Th\u00e9or. and tech. report no 60, Dept. of Computer Science, Univ. of Nebraska, Lincoln, July 1987."},{"key":"7_CR11","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1974)."},{"key":"7_CR12","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft \u2014 J.D. Ullman, Introduction to Automata Theory, Languages and Computation, (Addison-Wesley, Reading MA, 1979)"},{"key":"7_CR13","volume-title":"An introduction to Semigroup Theory","author":"J.M. Howie","year":"1976","unstructured":"J.M. Howie, An introduction to Semigroup Theory, (Academic Press, New York, 1976)"},{"key":"7_CR14","first-page":"17","volume":"19","author":"J.P. P\u00e9cuchet","year":"1985","unstructured":"J.P. P\u00e9cuchet, Automates boustroph\u00e9dons, semi-groupe de Birget et mono\u00efde inversif libre, RAIRO Inform. Th\u00e9or.\n19 (1985) 17\u2013100 and Automates boustroph\u00e9dons, langages reconnaissables de mots infinis et vari\u00e9t\u00e9s de semigroupes, Th\u00e8se d'Etat, LITP Mai 1986.","journal-title":"Inform. Th\u00e9or."},{"key":"7_CR15","unstructured":"D. Perrin, Automates avec multiplicit\u00e9s, tech. report LITP no 88\u201342, Mai 1988"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin \u2014 D. Scott, Finite Automata and their Decision Problems, IBM J. Res. Dev.\n3, (1959) 114\u2013125; and in E.F. Moore, Sequential Machines: Selected Papers, (Addison-Wesley, Reading, MA, 1964).","journal-title":"IBM J. Res. Dev."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"A. Saloma \u2014 M. Soittola, Automata-theoretic Aspects of Formal Power Series, (Springer Verlag, 1978)","DOI":"10.1007\/978-1-4612-6264-0"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"M.P. Sch\u00fctzenberger, On the definition of a family of automata, Information and Control\n4, (1961) 245\u2013270","journal-title":"Information and Control"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"885","DOI":"10.2307\/2034080","volume":"13","author":"M.P. Sch\u00fctzenberger","year":"1962","unstructured":"M.P. Sch\u00fctzenberger, On a theorem of R. Jungen, Proc. Amer. Math. Soc., 13, (1962) 885\u2013889","journal-title":"Proc. Amer. Math. Soc."},{"key":"7_CR20","unstructured":"M.P. Sch\u00fctzenberger, Certain elementary families of automata, Proc. Symposium on Math. th. of Automata, Polytechnic Institute of Brooklyn, (1962) 139\u2013153"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J.C. Sheperdson","year":"1959","unstructured":"J.C. Sheperdson, The Reduction of Two-way Automata to One-way Automata, IBM J. Res.\n3 (1959), 198\u2013200; and in E.F. Moore, Sequential Machines: Selected Papers, (Addison-Wesley, Reading, MA, 1964).","journal-title":"IBM J. Res."},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(89)90205-6","volume":"30","author":"M. Y. Vardi","year":"1989","unstructured":"M. Y. Vardi, A Note on the Reduction of Two-way Automata to One-way Automata, Information Processing Letters\n30, (1989) 261\u2013264.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:42:33Z","timestamp":1558269753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}