{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:14Z","timestamp":1725572174745},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_50","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"648-659","source":"Crossref","is-referenced-by-count":3,"title":["An Algebraic Generalization of \u03c9-Regular Languages"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Kuich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"50_CR2","first-page":"167","volume":"7","author":"P. Bouyer","year":"2002","unstructured":"Bouyer, P., Petit, A.: A Kleene\/B\u00fcchi-like theorem for clock languages. J. of Automata, Languages and Combinatorics\u00a07, 167\u2013186 (2002)","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"50_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congr. Logic, Methodology and Philosophy of Science, 1960, pp. 1\u201311. Stanford University Press (1962)"},{"key":"50_CR4","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series. Technical Report 2002\u201338, Department of Mathematics and Computer Science, University of Leicester","DOI":"10.1007\/3-540-45061-0_35"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0021-8693(76)90106-X","volume":"42","author":"C. Elgot","year":"1976","unstructured":"Elgot, C.: Matricial theories. J. Algebra\u00a042, 391\u2013422 (1976)","journal-title":"J. Algebra"},{"key":"50_CR7","unstructured":"\u00c9sik, Z., Kuich, W.: Inductive \u2217-semirings. To appear in Theoretical Computer Science"},{"key":"50_CR8","unstructured":"\u00c9sik, Z., Kuich, W.: On iteration semiring-semimodule pairs (to appear)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9-regular languages I. Technical Report, Technische Universit\u00e4t Wien (2003)","DOI":"10.1007\/978-3-540-27812-2_7"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9-regular languages II. Technical Report, Technische Universit\u00e4t Wien (2003)","DOI":"10.1007\/978-3-540-27812-2_7"},{"key":"50_CR11","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg (1986)"},{"key":"50_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"50_CR13","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Elsevier, Amsterdam (2004)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:25:45Z","timestamp":1605759945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}