{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:27Z","timestamp":1725456987378},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032024","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"88-102","source":"Crossref","is-referenced-by-count":5,"title":["Two-way automata with multiplicity"],"prefix":"10.1007","author":[{"given":"M.","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"M. Anselmo, Automates et codes zig-zag, to appear in RAIRO-Informatique Th\u00e9orique; and tech. report LITP no 88-74, Novembre 1988","key":"8_CR1"},{"unstructured":"M. Anselmo, Sur les codes zig-zag et leur d\u00e9cidabilit\u00e9, to appear in TCS; and tech. report LITP no 89-36, Mai 1989","key":"8_CR2"},{"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-61, Juillet 1989","key":"8_CR3"},{"unstructured":"M. Anselmo, The zig-zag power-series: a two-way version of the star operator, to appear in TCS, special edition","key":"8_CR4"},{"unstructured":"M. Anselmo, Automates bilat\u00e8res et codes zig-zag, th\u00e8se de doctorat, Universit\u00e9 Paris 7 (1990); tech. rep. LITP no 90-27 Mars 1990","key":"8_CR5"},{"unstructured":"M. Anselmo, Two-way Reading on Words, submitted to IMYCS 90","key":"8_CR6"},{"unstructured":"J. Berstel-D.Perrin, Theory of codes, Academic Press (1985)","key":"8_CR7"},{"unstructured":"J.Berstel-C.Reutenauer, Les s\u00e9ries rationnelles et leur languages, Masson (1984)","key":"8_CR8"},{"key":"8_CR9","series-title":"Technical Report","volume-title":"Concatenations of Inputs in a Two-way Automaton","author":"J.C. Birget","year":"1987","unstructured":"J.C. Birget, Concatenations of Inputs in a Two-way Automaton, Technical Report no 46, Dept. of Computer Science, U. of Nebraska, Lincoln (April 1987)"},{"key":"8_CR10","series-title":"Technical Report","volume-title":"Two-way Automaton Computations","author":"J.C. Birget","year":"1987","unstructured":"J.C. Birget, Two-way Automaton Computations, Technical Report no60, Dept. of Computer Science, U. of Nebraska, Lincoln (July 1987); and to appear in RAIRO-Informatique Th\u00e9orique"},{"unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press (1974)","key":"8_CR11"},{"unstructured":"J.E. Hopcroft-J.D.Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley (1979)","key":"8_CR12"},{"key":"8_CR13","volume-title":"Formale Sprachen","author":"G. Hotz","year":"1981","unstructured":"G. Hotz-K. Estenfeld, Formale Sprachen, Bibliographisches Institut, Mannheim (1981)"},{"doi-asserted-by":"crossref","unstructured":"S. C. Kleene, Representation of events in nerve nets and finite automata, in C. E. Shannon, J. McCharty (eds.) \"Automata Studies\", Princeton N. J. 1956, 3\u201340","key":"8_CR14","DOI":"10.1515\/9781400882618-002"},{"issue":"3","key":"8_CR15","doi-asserted-by":"crossref","first-page":"513","DOI":"10.4153\/CJM-1986-025-6","volume":"XXXVIII","author":"M. Nivat","year":"1986","unstructured":"M. Nivat-D. Perrin, Ensembles reconnaissables de mots biinfinis, Can. J. Math., Vol. XXXVIII, no 3, 1986, pp. 513\u2013537","journal-title":"Can. J. Math."},{"issue":"1","key":"8_CR16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1051\/ita\/1985190100711","volume":"19","author":"J.P. P\u00e9cuchet","year":"1985","unstructured":"J.P. P\u00e9cuchet, Automates boustroph\u00e9dons, langages reconnaissables de mots infinis et vari\u00e9t\u00e9s de semi-groupes (th\u00e8se d'Etat) LITP Mai 1986; and in Automates boustroph\u00e9dons, semi-groupe de Birget et mono\u00efde inversif libre, RAIRO Informatique Th\u00e9orique, 19, no 1, 1985 pp 17\u2013100.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"unstructured":"D. Perrin, Automates avec multiplicit\u00e9s, tech. report LITP no88-42, Mai 1988","key":"8_CR17"},{"doi-asserted-by":"crossref","unstructured":"M. O. Rabin-D. Scott, Finite Automata and their Decision Problems, IBM J. Res. Dev., 3, no2 (1959) 114\u2013125; and in E.F. Moore (editor), \"Sequential Machines: Selected Papers\", Addison-Wesley (1964).","key":"8_CR18","DOI":"10.1147\/rd.32.0114"},{"key":"8_CR19","doi-asserted-by":"crossref","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 vol. 4, pp 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"8_CR20","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., vol. 13, pp 885\u2013889 (1962)","journal-title":"Proc. Amer. Math. Soc."},{"unstructured":"M.P.Sch\u00fctzenberger, Certain elementary families of automata, Proc. Symposium on Math. th. of Automata, Polytechnic Institute of Brooklyn, pp 139\u2013153 (1962)","key":"8_CR21"},{"doi-asserted-by":"crossref","unstructured":"J.C.Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res.3, 2 (1959), 198\u2013200; and in E.F. Moore (editor), \"Sequential Machines: Selected Papers\", Addison-Wesley (1964).","key":"8_CR22","DOI":"10.1147\/rd.32.0198"},{"key":"8_CR23","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 30, pp 261\u2013264 (1989).","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032024.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:05:30Z","timestamp":1607533530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0032024","relation":{},"subject":[]}}