{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:52Z","timestamp":1725490072196},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_20","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"226-237","source":"Crossref","is-referenced-by-count":9,"title":["Factorisation Forests for Infinite Words"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"285","volume-title":"IEEE Symposium on Logic In Computer Science","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in omega-regularity. In: IEEE Symposium on Logic In Computer Science, pp. 285\u2013296. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"2","key":"20_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.2140\/pjm.1971.36.285","volume":"36","author":"T.C. Brown","year":"1971","unstructured":"Brown, T.C.: An interesting combinatorial method in the theory of locally finite semigroups. Pacific Journal of Mathematics\u00a036(2), 277\u2013294 (1971)","journal-title":"Pacific Journal of Mathematics"},{"key":"20_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)"},{"unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University press (1960)","key":"20_CR4"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1142\/S0129054105003285","volume":"16","author":"O. Carton","year":"2005","unstructured":"Carton, O., Rispal, C.: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci.\u00a016(4), 767\u2013786 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"20_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0304-3975(03)00344-X","volume":"310","author":"J. Chalopin","year":"2004","unstructured":"Chalopin, J., Leung, H.: On factorization forests of finite height. Theoretical Computer Science\u00a0310(1\u20133), 489\u2013499 (2004)","journal-title":"Theoretical Computer Science"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"ICALP 2007","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T.: A combinatorial theorem for trees. In: ICALP 2007. LNCS, Springer, Heidelberg (2007)"},{"key":"20_CR8","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"Lallement, G.: Semigroups and Combinatorial Applications. Wiley, New-York (1979)"},{"doi-asserted-by":"crossref","unstructured":"Pin, J.: Varieties of formal languages. North Oxford, London and Plenum, New-York (1986)","key":"20_CR9","DOI":"10.1007\/978-1-4613-2215-3"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1142\/S0218196791000195","volume":"1","author":"J. Pin","year":"1991","unstructured":"Pin, J., le Sa\u00ebc, B., Weil, P.: Semigroups with idempotent stabilizers and application to automata theory. Int. J. of Alg. and Comput.\u00a01(3), 291\u2013314 (1991)","journal-title":"Int. J. of Alg. and Comput."},{"issue":"4","key":"20_CR11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E., Weil, P.: Polynominal closure and unambiguous product. Theory Comput. Syst.\u00a030(4), 383\u2013422 (1997)","journal-title":"Theory Comput. Syst."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M.: 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":"20_CR13","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, New York (1982)"},{"key":"20_CR14","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 Math.\u00a0102, 379\u2013419 (1975)","journal-title":"Annals Math."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theor. Comput. Sci.\u00a072(1), 65\u201394 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:07Z","timestamp":1619518507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}