{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:21Z","timestamp":1725567081620},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_12","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T17:40:25Z","timestamp":1285522825000},"page":"134-145","source":"Crossref","is-referenced-by-count":4,"title":["Sch\u00fctzenberger and Eilenberg Theorems for Words on Linear Orderings"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chlo\u00e9","family":"Rispal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Series in algebra","volume-title":"Finite semigroups and universal algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite semigroups and universal algebra. Series in algebra, vol.\u00a03. World Scientific, Singapore (1994)"},{"key":"12_CR2","unstructured":"Bedon, N.: Langages reconnaissables de mots index\u00e9s par des ordinaux. PhD thesis, University of Marne-la-Vall\u00e9e, France (1998)"},{"issue":"3","key":"12_CR3","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. Journal of Computer and System Science\u00a063(3), 394\u2013431 (2001)","journal-title":"Journal of Computer and System Science"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.2000.3009","volume":"166","author":"N. Bedon","year":"2001","unstructured":"Bedon, N.: Star-free sets of words on ordinals. Inform. Comput.\u00a0166, 93\u2013111 (2001)","journal-title":"Inform. Comput."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0054310","volume-title":"LATIN\u201998: Theoretical Informatics","author":"N. Bedon","year":"1998","unstructured":"Bedon, N., Carton, O.: An eilenberg theorem for words on countable ordinals. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 53\u201364. Springer, Heidelberg (1998)"},{"key":"12_CR6","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":"12_CR7","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. Zeit. Math. Logik. Grund. Math.\u00a06, 66\u201392 (1960)","journal-title":"Zeit. Math. Logik. Grund. Math."},{"key":"12_CR8","volume-title":"Automata, languages and machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages and machines, vol.\u00a0B. Academic Press, London (1976)"},{"key":"12_CR9","volume-title":"Set Theory","author":"F. Hausdorff","year":"1957","unstructured":"Hausdorff, F.: Set Theory. Chelsea, New York (1957)"},{"key":"12_CR10","volume-title":"Counter free automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter free automata. MIT Press, Cambridge (1971)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","first-page":"180","volume-title":"STACS 86","author":"J.-P. P\u00e9cuchet","year":"1985","unstructured":"P\u00e9cuchet, J.-P.: Vari\u00e9t\u00e9s de semigroupes et mots infinis. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol.\u00a0210, pp. 180\u2013191. Springer, Heidelberg (1985)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0030294","volume-title":"Mathematical Foundations of Computer Science 1984","author":"D. Perrin","year":"1984","unstructured":"Perrin, D.: Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol.\u00a0176, pp. 134\u2013148. Springer, Heidelberg (1984)"},{"key":"12_CR13","first-page":"1","volume-title":"Handbook of theoretical computer science","author":"D. Perrin","year":"1990","unstructured":"Perrin, D.: Finite automata. In: Handbook of theoretical computer science, vol.\u00a0B, pp. 1\u201353. Elsevier, Amsterdam (1990)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D. Perrin","year":"1986","unstructured":"Perrin, D., Pin, J.-\u00c9.: First order logic and star-free sets. J. Comput. System Sci.\u00a032, 393\u2013406 (1986)","journal-title":"J. Comput. System Sci."},{"key":"12_CR15","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words: Automata, Semigroups, Logic and Games","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"12_CR16","volume-title":"Vari\u00e9t\u00e9s de langages formels","author":"J.-\u00c9. Pin","year":"1984","unstructured":"Pin, J.-\u00c9.: Vari\u00e9t\u00e9s de langages formels. Masson, Paris (1984); English version: Varieties of formal languages. Plenum Press, New-York (1986)"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of formal languages","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9.: Syntactic semigroups. In: Handbook of formal languages, vol.\u00a01, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"key":"12_CR18","unstructured":"Rispal, C.: Automates sur les ordres lin\u00e9aires: compl\u00e9mentation. PhD thesis, University of Marne-la-Vall\u00e9e, France (2004)"},{"key":"12_CR19","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":"12_CR20","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.-P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.-P.: On finite monoids having only trivial subgroups. Inform. Control\u00a08, 190\u2013194 (1965)","journal-title":"Inform. Control"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/3-540-54233-7_166","volume-title":"Automata, Languages and Programming","author":"T. Wilke","year":"1991","unstructured":"Wilke, T.: An Eilenberg theorem for \u221e-languages. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 588\u2013599. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11505877_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T05:54:02Z","timestamp":1553147642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11505877_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265467","9783540316824"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11505877_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}