{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:39Z","timestamp":1725536019990},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034657"},{"type":"electronic","value":"9783642034664"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03466-4_12","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T07:20:54Z","timestamp":1249284054000},"page":"185-199","source":"Crossref","is-referenced-by-count":1,"title":["Context-Free Languages of Countable Words"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","volume":"156","author":"N. Bedon","year":"1996","unstructured":"Bedon, N.: Finite automata and ordinals. Theor. Comp. Sci.\u00a0156, 119\u2013144 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-79709-8_11","volume-title":"Computer Science \u2013 Theory and Applications","author":"N. Bedon","year":"2008","unstructured":"Bedon, N., B\u00e8s, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 76\u201385. Springer, Heidelberg (2008)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11505877_14","volume-title":"Developments in Language Theory","author":"A. B\u00e8s","year":"2005","unstructured":"B\u00e8s, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 158\u2013167. Springer, Heidelberg (2005)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0304-3975(00)00040-2","volume":"259","author":"S.L. Bloom","year":"2001","unstructured":"Bloom, S.L., Choffrut, Ch.: Long words: the theory of concatenation and \u03c9-power. Theor. Comp. Sci.\u00a0259, 533\u2013548 (2001)","journal-title":"Theor. Comp. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1051\/ita:2004005","volume":"38","author":"S.L. Bloom","year":"2004","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomating omega and omega-op powers of words. Theor. Inform. Appl.\u00a038, 3\u201317 (2004)","journal-title":"Theor. Inform. Appl."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2005.01.004","volume":"197","author":"S.L. Bloom","year":"2005","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational theory of regular words. Inform. and Comput.\u00a0197, 55\u201389 (2005)","journal-title":"Inform. and Comput."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73859-6_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"S.L. Bloom","year":"2007","unstructured":"Bloom, S.L., \u00c9sik, Z.: Regular and algebraic words and ordinals. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","volume":"73","author":"V. Bruy\u00e8re","year":"2007","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. J. Comput. System Sci.\u00a073, 1\u201324 (2007)","journal-title":"J. Comput. System Sci."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik und Grundlagen Math."},{"key":"12_CR10","series-title":"Lecture Notes in Math","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0082721","volume-title":"Decidable theories, II","author":"J.R. B\u00fcchi","year":"1973","unstructured":"B\u00fcchi, J.R.: The monadic second order theory of \u03c9 1. In: Decidable theories, II. Lecture Notes in Math., vol.\u00a0328, pp. 1\u2013127. Springer, Heidelberg (1973)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y. Choueka","year":"1978","unstructured":"Choueka, Y.: Finite automata, definable sets, and regular expressions over \u03c9 n -tapes. J. Comput. System Sci.\u00a017(1), 81\u201397 (1978)","journal-title":"J. Comput. System Sci."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","volume":"15","author":"R.S. Cohen","year":"1977","unstructured":"Cohen, R.S., Gold, A.Y.: Theory of \u03c9-languages, parts one and two. Journal of Computer and System Science\u00a015, 169\u2013208 (1977)","journal-title":"Journal of Computer and System Science"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1051\/ita\/1978120403191","volume":"12","author":"B. Courcelle","year":"1978","unstructured":"Courcelle, B.: Frontiers of infinite trees. RAIRO Theor. Inf.\u00a012, 319\u2013337 (1978)","journal-title":"RAIRO Theor. Inf."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. System Sci.\u00a04, 406\u2013451 (1970)","journal-title":"J. Comput. System Sci."},{"key":"12_CR15","unstructured":"\u00c9sik, Z., Ito, M., Kuich, W.: Linear languages of finite and infinite words (to appear)"},{"key":"12_CR16","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1051\/ita\/1980140201311","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. RAIRO Theor. Inf.\u00a014, 131\u2013141 (1980)","journal-title":"RAIRO Theor. Inf."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita\/1978120302591","volume":"12","author":"M. Nivat","year":"1978","unstructured":"Nivat, M.: Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique (French). RAIRO Inform. Th\u00e9or.\u00a012(3), 259\u2013278 (1978)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"12_CR19","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Elsevier, Amsterdam (2004)"},{"key":"12_CR20","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"12_CR21","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Math. Systems Theory"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1051\/ita\/1986200403711","volume":"20","author":"W. Thomas","year":"1986","unstructured":"Thomas, W.: On frontiers of regular sets. RAIRO Theor. Inf.\u00a020, 371\u2013381 (1986)","journal-title":"RAIRO Theor. Inf."},{"key":"12_CR24","first-page":"135","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 135\u2013191. Elsevier, Amsterdam (1990)"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/FI-1984-7203","volume":"7","author":"J. Wojciechowski","year":"1984","unstructured":"Wojciechowski, J.: Classes of transfinite sequences accepted by finite automata. Fundamenta Informatic\u00e6\u00a07, 191\u2013223 (1984)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"12_CR26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8","author":"J. Wojciechowski","year":"1985","unstructured":"Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta Informatic\u00e6\u00a08, 379\u2013396 (1985)","journal-title":"Fundamenta Informatic\u00e6"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T08:13:28Z","timestamp":1633767208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}