{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:36Z","timestamp":1725474636443},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_27","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T23:48:02Z","timestamp":1164671282000},"page":"285-296","source":"Crossref","is-referenced-by-count":0,"title":["Tree Automata Make Ordinal Theory Easy"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Cachat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1&2","key":"27_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. Comput. Sci.\u00a0156(1&2), 119\u2013144 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1006\/jcss.2001.1782","volume":"63","author":"N. Bedon","year":"2001","unstructured":"Bedon, N.: Logic over words on denumerable ordinals. J. Comput. System Sci.\u00a063(3), 394\u2013431 (2001)","journal-title":"J. Comput. System Sci."},{"key":"27_CR3","unstructured":"Bruy\u00e8re, V., Carton, O., S\u00e9nizergues, G.: Tree automata and automata on linear orderings. In: Proceedings of WORDS 2003, TUCS Gen. Publ., Turku Cent. Comput. Sci., Turku, vol.\u00a027, pp. 222\u2013231 (2003)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. Richard B\u00fcchi","year":"1960","unstructured":"Richard B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Richard B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press (1962)","DOI":"10.1016\/S0049-237X(09)70564-6"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1090\/S0002-9904-1965-11384-2","volume":"71","author":"J. Richard B\u00fcchi","year":"1965","unstructured":"Richard B\u00fcchi, J.: Decision methods in the theory of ordinals. Bull. Amer. Math. Soc.\u00a071, 767\u2013770 (1965)","journal-title":"Bull. Amer. Math. Soc."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-45061-0_45","volume-title":"Automata, Languages and Programming","author":"T. Cachat","year":"2003","unstructured":"Cachat, T.: Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 556\u2013569. Springer, Heidelberg (2003)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24698-5_33","volume-title":"LATIN 2004: Theoretical Informatics","author":"O. Carton","year":"2004","unstructured":"Carton, O., Rispal, C.: Complementation of rational sets on scattered linear orderings of finite rank. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 292\u2013301. Springer, Heidelberg (2004)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"27_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) (release October 1, 2002), Available on: http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. C. R. Math. Acad. Sci. Paris\u00a0339(1), 5\u201310 (2004)","journal-title":"C. R. Math. Acad. Sci. Paris"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-56610-4_68","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"N. Dershowitz","year":"1993","unstructured":"Dershowitz, N.: Trees, ordinals and termination. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 243\u2013250. Springer, Heidelberg (1993)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/LICS.2004.1319605","volume-title":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"F. Klaedtke","year":"2004","unstructured":"Klaedtke, F.: On the automata size for Presburger arithmetic. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 110\u2013119. IEEE Computer Society Press, Los Alamitos (2004); A full version of the paper is available from the author\u2019s web page"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/10722167_7","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to reasoning about infinite-state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 36\u201352. Springer, Heidelberg (2000)"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(95)00221-9","volume":"165","author":"F. Maurin","year":"1996","unstructured":"Maurin, F.: Exact complexity bounds for ordinal addition. Theoretical Computer Science\u00a0165(2), 247\u2013273 (1996)","journal-title":"Theoretical Computer Science"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Nie\u00dfner, F.: Nondeterministic tree automata. In: Gr\u00e4del, et al. [13], pp. 135\u2013152","DOI":"10.1007\/3-540-36387-4_8"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","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"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: The complexity of translating logic to finite automata. In: Gr\u00e4del, et al. (eds.) [13], pp. 231\u2013238","DOI":"10.1007\/3-540-36387-4_13"},{"key":"27_CR20","volume-title":"Linear orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear orderings. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York (1982)"},{"key":"27_CR21","unstructured":"Sierpi\u0144ski, W.: Cardinal and ordinal numbers, 2nd revised edn., Monografie Matematyczne, Pa\u0144stowe Wydawnictwo Naukowe, Warsaw, vol.\u00a034 (1965)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Weyer, M.: Decidability of S1S and S2S. In: Gr\u00e4del, et al. (eds.) [13], pp. 207\u2013230","DOI":"10.1007\/3-540-36387-4_12"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T16:59:29Z","timestamp":1683651569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11944836_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}