{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:19Z","timestamp":1725493579105},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_2","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T07:27:35Z","timestamp":1193470055000},"page":"3-11","source":"Crossref","is-referenced-by-count":1,"title":["Automata on Words"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context-Free Languages, Teubner, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"2_CR2","unstructured":"J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1142\/S0218196799000199","volume":"9","author":"J. Cassaigne","year":"1999","unstructured":"J. Cassaigne, T. Harju, and J. Karhum\u00e4ki, On the undecidability of freeness of matrix semigroups, Intern. J. Alg. & Comp. 9, 295\u2013305, 1999.","journal-title":"Intern. J. Alg. & Comp"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(96)00311-8","volume":"183","author":"C. Choffrut","year":"1997","unstructured":"C. Choffrut, T. Harju, and J. Karhum\u00e4ki, A note on decidability questions on presentations of word semigroups, Theoret. Comput. Sci. 183, 83\u201392, 1997.","journal-title":"Theoret. Comput. Sci"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"C. Choffrut and J. Karhum\u00e4ki, Combinatorics of words, In: A. Salomaa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 1, 329\u2013438. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"2_CR6","unstructured":"M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-59849-4"},{"key":"2_CR8","unstructured":"J. E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1006\/jcta.2002.3292","volume":"100","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"J. Karhum\u00e4ki, A. Lepist\u00f6, and W. Plandowski, Locally periodic infinite words and a chaotic behaviour, J. Comb. Theor., Ser. A 100, 250\u2013264, 2002.","journal-title":"J. Comb. Theor., Ser. A"},{"key":"2_CR10","unstructured":"A. Lepist\u00f6, On Relations between Local and Global Periodicity, Ph.D. Thesis, University of Turku, TUCS Dissertations 43, 2002."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics 17, Addison-Wesley, 1983. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511566097"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics 90, Cambridge University Press, 2002.","DOI":"10.1017\/CBO9781107326019"},{"key":"2_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-45687-2_3","volume-title":"Applications of finite automata, Invited talk of MFCS02","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"J. Karhum\u00e4ki, Applications of finite automata, Invited talk of MFCS02, LNCS 2420, 40\u201358, Springer-Verlag, 2002."},{"key":"2_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-60246-1_140","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F. Mignosi","year":"1995","unstructured":"F. Mignosi, A. Restivo, and S. Salemi, A periodicity theorem on words and applications, In: J. Wiedermann and P. Hajek (Eds.), Mathematical Foundations of Computer Science 1995, LNCS 969, 337\u2013348, Springer-Verlag, 1995."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0304-3975(98)00037-1","volume":"204","author":"F. Mignosi","year":"1998","unstructured":"F. Mignosi, A. Restivo, and S. Salemi, Periodicity and golden ratio, Theoret. Comput. Sci. 204, 153\u2013167, 1998.","journal-title":"Theoret. Comput. Sci"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0019-9958(83)80044-8","volume":"57","author":"A. Restivo","year":"1983","unstructured":"A. Restivo and C. Reutenauer, Some applications of a theorem of Shirshov to language theory, Information and Control 57, 205\u2013213, 1983.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45089-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T17:09:05Z","timestamp":1588007345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}