{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:19:43Z","timestamp":1767910783022,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540542339","type":"print"},{"value":"9783540475163","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_166","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:39:07Z","timestamp":1330209547000},"page":"588-599","source":"Crossref","is-referenced-by-count":32,"title":["An EILENBERG theorem for \u221e-languages"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Wilke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"A. Arnold. A syntactic congruence for rational \u03c9-languages. Theoretical Computer Science, 39:333\u2013335, 1985.","journal-title":"Theoretical Computer Science"},{"key":"46_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BFb0035752","volume-title":"Automata, Languages and Programming","author":"Dani\u00e8le Beauquier","year":"1989","unstructured":"D. Beauquier and J. E. Pin. Factors of words. In Proceedings on the 16th ICALP, pages 63\u201379, Berlin, 1989. Springer. LNCS 372."},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"B. Courcelle. On recognizable sets and tree automata. In H. A\u00eft Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 1, pages 93\u2013126. Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046370-1.50009-7"},{"key":"46_CR4","unstructured":"S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"J.-P. P\u00e9cuchet. Etude syntaxique des parties reconnaissables de mots infinis. In L. Kott, editor, Proceedings on the 13th ICALP, pages 294\u2013303. Springer, 1986. LNCS 226.","DOI":"10.1007\/3-540-16761-7_79"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"J.-P. P\u00e9cuchet. Vari\u00e9t\u00e9s de semigroupes et mots infinis. In G. Vidal-Naquet, editor, Proceedings on the 3rd Symposium on Theoretical Aspects of Computer Science, pages 180\u2013191, Berlin, Heidelberg, New York, 1986. Springer. LNCS 210.","DOI":"10.1007\/3-540-16078-7_75"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"J.-P. P\u00e9cuchet. Automates boustrophedons, languages reconnaissables de mots infinis et vari\u00e9t\u00e9s de semigroupes. PhD thesis, Univ. Rouen, 1987.","DOI":"10.1007\/3-540-16761-7_79"},{"key":"46_CR8","first-page":"595","volume":"295","author":"D. Perrin","year":"1982","unstructured":"D. Perrin. Vari\u00e9t\u00e9s de semigroupes et mots infinis. Comptes Rendues Academie de Science Paris, 295:595\u2013598, 1982.","journal-title":"Comptes Rendues Academie de Science Paris"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"D. Perrin. Recent results on automata and infinite words. In Mathematical Foundation of Computer Science, pages 134\u2013148, Berlin, Heidelberg, New York, 1984. Springer. LNCS 176.","DOI":"10.1007\/BFb0030294"},{"key":"46_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.-E. Pin","year":"1986","unstructured":"J.-E. Pin. Varieties of Formal Languages. North Oxford Academic Press, London, 1986."},{"key":"46_CR11","first-page":"214","volume-title":"Lecture Notes in Computer Science","author":"Imre Simon","year":"1975","unstructured":"I. Simon. Piecewise testable events. In Proceedings of the 2nd GI Conference, pages 214\u2013222, Berlin, Heidelberg, New York, 1975. Springer Verlag. LNCS 33."},{"key":"46_CR12","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"L. Staiger and K. Wagner. Automatentheoretische Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik, 10:379\u2013392, 1974.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"46_CR13","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134\u2013191. Elsevier Science Publishers B.V., 1980."},{"key":"46_CR14","unstructured":"Th. Wilke. An EILENBERG theorem for \u221e-languages. In Proceedings of the Workshop \u2018Logics and Recognizable Sets', Rep. 9004, Inst. f. Informatik u. Prakt. Math., Univ. Kiel, 1990."},{"key":"46_CR15","unstructured":"Th. Wilke. Eine Eilenberg-Korrespondenz f\u00fcr regul\u00e4re \u221e-Sprachen. Diploma thesis, RWTH Aachen, 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_166.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:19Z","timestamp":1605646399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_166","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}