{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:46Z","timestamp":1725567106177},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265467"},{"type":"electronic","value":"9783540316824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11505877_14","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T17:40:25Z","timestamp":1285522825000},"page":"158-167","source":"Crossref","is-referenced-by-count":8,"title":["A Kleene Theorem for Languages of Words Indexed by Linear Orderings"],"prefix":"10.1007","author":[{"given":"Alexis","family":"B\u00e8s","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 160\u2013171 (1997)","DOI":"10.1109\/LICS.1997.614944"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0029958","volume-title":"Mathematical Foundations of Computer Science 1997","author":"B. B\u00e9rard","year":"1997","unstructured":"B\u00e9rard, B., Picaronny, C.: Accepting Zeno words without making time stand still. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 149\u2013158. Springer, Heidelberg (1997)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44683-4_21","volume-title":"Mathematical Foundations of Computer Science 2001","author":"V. Bruy\u00e8re","year":"2001","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 236\u2013247. Springer, Heidelberg (2001)"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-0-387-35608-2_10","volume-title":"Foundation of Information technology in the era of network and mobile computing","author":"V. Bruy\u00e8re","year":"2002","unstructured":"Bruy\u00e8re, V., Carton, O.: Hierarchy among automata on linear orderings. In: Baeza-Yate, R., Montanari, U., Santoro, N. (eds.) Foundation of Information technology in the era of network and mobile computing, pp. 107\u2013118. Kluwer Academic Publishers, Boston (2002)"},{"key":"14_CR5","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 grundl. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik und grundl. Math."},{"key":"14_CR6","first-page":"1","volume-title":"Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in the restricted second-order arithmetic. In: Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley, pp. 1\u201311. Stanford University Press, Standford (1962)"},{"key":"14_CR7","unstructured":"B\u00fcchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, North Holland, pp. 2\u201323 (1965)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45687-2_12","volume-title":"Mathematical Foundations of Computer Science 2002","author":"O. Carton","year":"2002","unstructured":"Carton, O.: Accessibility in automata on scattered linear orderings. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 155\u2013164. Springer, Heidelberg (2002)"},{"issue":"1","key":"14_CR9","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 \u03c9n-tapes. J. Comput. System Sci.\u00a017(1), 81\u201397 (1978)","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"14_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1978120403191","volume":"12","author":"B. Courcelle","year":"1978","unstructured":"Courcelle, B.: Frontiers of infinite trees. RAIRO Theoretical informatics\u00a012(4), 319\u2013337 (1978)","journal-title":"RAIRO Theoretical informatics"},{"issue":"1","key":"14_CR11","first-page":"3","volume":"6","author":"C. Dima","year":"2001","unstructured":"Dima, C.: Real-time automata. Journal of Automata, Languages and Combinatorics\u00a06(1), 3\u201324 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2-3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(84)90095-1","volume":"33","author":"D. Girault-Beauquier","year":"1984","unstructured":"Girault-Beauquier, D.: Bilimites de langages reconnaissables. Theoret. Comput. Sci.\u00a033(2-3), 335\u2013342 (1984)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)00145-9","volume":"138","author":"M.R. Hansen","year":"1995","unstructured":"Hansen, M.R., Pandya, P.K., Chaochen, Z.: Finite divergence. Theoret. Comput. Sci.\u00a0138(1), 113\u2013139 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"14_CR14","doi-asserted-by":"crossref","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 Theoretical informatics\u00a014(2), 131\u2013141 (1980)","journal-title":"RAIRO Theoretical informatics"},{"key":"14_CR15","first-page":"3","volume-title":"Automata studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E. (ed.) Automata studies, pp. 3\u201341. Princeton university Press, Princeton (1956)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SWCT.1963.8","volume-title":"Switching Circuit Theory and Logical Design: Proc. Fourth Annual Symp.","author":"D.E. Muller","year":"1963","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Switching Circuit Theory and Logical Design: Proc. Fourth Annual Symp., pp. 3\u201316. IEEE, New York (1963)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Nivat, M., Perrin, D.: Ensembles reconnaissables de mots bi-infinis. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 47\u201359 (1982)","DOI":"10.1145\/800070.802176"},{"key":"14_CR18","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. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1-2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(98)00050-4","volume":"233","author":"A. Rabinovich","year":"2000","unstructured":"Rabinovich, A.: Star free expressions over the reals. Theoret. Comput. Sci.\u00a0233(1-2), 233\u2013245 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-30550-7_32","volume-title":"Developments in Language Theory","author":"C. Rispal","year":"2004","unstructured":"Rispal, C., Carton, O.: Complementation of rational sets on countable scattered linear orderings. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 381\u2013392. Springer, Heidelberg (2004)"},{"key":"14_CR21","volume-title":"Linear orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear orderings. Academic Press, New York (1982)"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Annals of Mathematics\u00a0102, 379\u2013419 (1975)","journal-title":"Annals of Mathematics"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1986200403711","volume":"20","author":"W. Thomas","year":"1986","unstructured":"Thomas, W.: On frontiers of regular sets. RAIRO Theoretical informatics\u00a020, 371\u2013381 (1986)","journal-title":"RAIRO Theoretical informatics"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-63246-8_8","volume-title":"Structures in Logic and Computer Science","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 118\u2013143. Springer, Heidelberg (1997)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Carton, O., Bruy\u00e8re, V., S\u00e9nizergues, G.: Tree automata and automata on linear orderings. In: Harju, T., Karhum\u00e4ki, J. (eds.) WORDS 2003, pp. 222\u2013231. Turku Center for Computer Science (2003)","DOI":"10.1007\/3-540-45005-X_9"},{"issue":"3-4","key":"14_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(3-4), 379\u2013396 (1985)","journal-title":"Fundamenta informatic\u00e6"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11505877_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T17:59:32Z","timestamp":1636567172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11505877_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265467","9783540316824"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11505877_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}