{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:30:59Z","timestamp":1725492659955},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404316"},{"type":"electronic","value":"9783540450054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45005-x_9","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T04:27:47Z","timestamp":1192768067000},"page":"103-115","source":"Crossref","is-referenced-by-count":7,"title":["Automata on Linear Orderings"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"E. Asarin. Equations on timed languages. In T. Henzinger and S. Sastry, editors, Hybrid Systems: Computation and Control, number 1386 in Lect. Notes in Comput. Sci., pages 1\u201312, 1998.","DOI":"10.1007\/3-540-64358-3_28"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 160\u2013171, 1997.","DOI":"10.1109\/LICS.1997.614944"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"N. Bedon and O. Carton. An Eilenberg theorem for words on countable ordinals. In Cl\u00e1udio L. Lucchesi and Arnaldo V. Moura, editors, Latin\u201998: Theoretical Informatics, volume 1380 of Lect. Notes in Comput. Sci., pages 53\u201364. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054310"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard and C. Picaronny. Accepting Zeno words without making time stand still. In Mathematical Foundations of Computer Science 1997, volume 1295 of Lect. Notes in Comput. Sci., pages 149\u2013158, 1997.","DOI":"10.1007\/BFb0029958"},{"key":"9_CR5","unstructured":"P. Bouyer and A. Petit. A Kleene\/B\u00fcchi-like theorem for clock languages. J. of Automata, Languages and Combinatorics, 2001. To appear."},{"key":"9_CR6","unstructured":"V. Bruy\u00e8re and O. Carton. Automata on linear orderings. Technical Report 2000-12, Institut Gaspard Monge, 2000. Submitted."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"V. Bruy\u00e8re and O. Carton. Automata on linear orderings. In Ji\u0159\u00ed Sgall, Ale\u0161 Pultr, and Petr Kolman, editors, MFCS\u20192001, volume 2136 of Lect. Notes in Comput. Sci., pages 236\u2013247, 2001.","DOI":"10.1007\/3-540-44683-4_21"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"V. Bruy\u00e8re and O. Carton. Hierarchy among automata on linear orderings. In R. Baeza-Yates, U. Montanari, and N. Santoro, editors, TCS\u20192002\/IFIP\u20192002, pages 107\u2013118. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-0-387-35608-2_10"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J. R. B\u00fcchi. Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math., 6:66\u201392, 1960.","journal-title":"Z. Math. Logik und grundl. Math."},{"key":"9_CR10","unstructured":"J. R. B\u00fcchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1\u201311. Stanford University Press, 1962."},{"key":"9_CR11","unstructured":"J. R. B\u00fcchi. Transfinite automata recursions and weak second order theory of ordinals. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2\u201323. North Holland, 1965."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y. Choueka","year":"1978","unstructured":"Y. Choueka. Finite automata, definable sets, and regular expressions over \u03c9n-tapes. J. Comput. System Sci., 17(1):81\u201397, 1978.","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"9_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1978120403191","volume":"12","author":"B. Courcelle","year":"1978","unstructured":"B. Courcelle. Frontiers of infinite trees. RAIRO Theoretical Informatics, 12(4):319\u2013337, 1978.","journal-title":"RAIRO Theoretical Informatics"},{"issue":"2\u20133","key":"9_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(84)90095-1","volume":"33","author":"D. Girault-Beauquier","year":"1984","unstructured":"D. Girault-Beauquier. Bilimites de langages reconnaissables. Theoret. Comput. Sci., 33(2\u20133):335\u2013342, 1984.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)00145-9","volume":"138","author":"M. R. Hansen","year":"1995","unstructured":"M. R. Hansen, P. K. Pandya, and Z. Chaochen. Finite divergence. Theoret. Comput. Sci., 138(1):113\u2013139, 1995.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ita\/1980140201311","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"S. Heilbrunner. An algorithm for the solution of fixed-point equations for infinite words. RAIRO Theoretical Informatics, 14(2):131\u2013141, 1980.","journal-title":"RAIRO Theoretical Informatics"},{"key":"9_CR17","first-page":"3","volume-title":"Automata studies","author":"S. C. Kleene","year":"1956","unstructured":"S. C. Kleene. Representation of events in nerve nets and finite automata. In C.E. Shannon, editor, Automata studies, pages 3\u201341. Princeton University Press, Princeton, 1956."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"M. Nivat and D. Perrin. Ensembles reconnaissables de mots bi-infinis. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 47\u201359, 1982.","DOI":"10.1145\/800070.802176"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1\u201357. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"9_CR20","volume-title":"Linear Orderings","author":"J. G. Rosenstein","year":"1982","unstructured":"J. G. Rosenstein. Linear Orderings. Academic Press, New York, 1982."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379\u2013419, 1975.","journal-title":"Annals of Mathematics"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1986200403711","volume":"20","author":"W. Thomas","year":"1986","unstructured":"W. Thomas. On frontiers of regular sets. RAIRO Theoretical Informatics, 20:371\u2013381, 1986.","journal-title":"RAIRO Theoretical Informatics"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"W. Thomas. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, number 1261 in Lect. Notes in Comput. Sci., pages 118\u2013143. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63246-8_8"},{"issue":"3\u20134","key":"9_CR25","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8","author":"J. Wojciechowski","year":"1985","unstructured":"J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informatic\u00e6, 8(3\u20134):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\/3-540-45005-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T19:01:38Z","timestamp":1629918098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45005-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404316","9783540450054"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45005-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}