{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:50Z","timestamp":1759638470405},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73859-6_1","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:37:02Z","timestamp":1187681822000},"page":"1-15","source":"Crossref","is-referenced-by-count":6,"title":["Regular and Algebraic Words and Ordinals"],"prefix":"10.1007","author":[{"given":"S. L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. J. ACM\u00a024, 68\u201395 (1977)","journal-title":"J. ACM"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1142\/S0129054106003978","volume":"17","author":"A. B\u00e8s","year":"2006","unstructured":"B\u00e8s, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. Int. J. Foundations Computer Science\u00a017, 519\u2013542 (2006)","journal-title":"Int. J. Foundations Computer Science"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"45","author":"S.L. Bloom","year":"1976","unstructured":"Bloom, S.L.: Varieties of ordered algebras. J. Computers and Sys. Sci.\u00a045, 200\u2013212 (1976)","journal-title":"J. Computers and Sys. Sci."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0304-3975(00)00040-2","volume":"259","author":"S.L. Bloom","year":"2001","unstructured":"Bloom, S.L., Choffrut, C.: Long words: the theory of concatenation and \u03c9-power. Theoretical Computer Science\u00a0259, 533\u2013548 (2001)","journal-title":"Theoretical Computer Science"},{"key":"1_CR5","first-page":"26","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"Bloom, S.L., Elgot, C.C., Wright, J.B.: Solutions of the iteration equation and extensions of the scalar iteration operation. Siam J. Computing\u00a09, 26\u201345 (1980)","journal-title":"Siam J. Computing"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"Bloom, S.L., Elgot, C.C., Wright, J.B.: Vector iteration in pointed iterative theories. Siam J. Computing\u00a09, 525\u2013540 (1980)","journal-title":"Siam J. Computing"},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer, Heidelberg (1993)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"S.L. Bloom","year":"1997","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational logic of fixed points. Theoretical Computer Science\u00a0179, 1\u20132 (1997)","journal-title":"Theoretical Computer Science"},{"key":"1_CR9","first-page":"1","volume":"55","author":"S.L. Bloom","year":"2003","unstructured":"Bloom, S.L., \u00c9sik, Z.: Deciding whether the frontier of a regular tree is scattered. Fundamenta Informatica\u00a055, 1\u201321 (2003)","journal-title":"Fundamenta Informatica"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1051\/ita:2004005","volume":"38","author":"S.L. Bloom","year":"2004","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing omega and omega-op powers on words. Theoretical Informatics and Applications\u00a038, 3\u201317 (2004)","journal-title":"Theoretical Informatics and Applications"},{"issue":"1-2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2005.01.004","volume":"197","author":"S.L. Bloom","year":"2005","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational theory of regular words. Information and Computation\u00a0197(1-2), 55\u201389 (2005)","journal-title":"Information and Computation"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","volume":"73","author":"V. Bruy\u00e8re","year":"2007","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. J. Computer System Sciences\u00a073, 1\u201324 (2007)","journal-title":"J. Computer System Sciences"},{"key":"1_CR13","unstructured":"Bc\u0308hi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Logic, Methodology and Philosophy of Science Proc. 1964 Internatational Congress North-Holland, Amsterdam, pp. 3\u201323 (1965)"},{"key":"1_CR14","unstructured":"Courcelle, B.: A representation of trees by languages, 1 and II, Theoretical Computer Science, 6, 155-279, 7, 25\u201355 (1978)"},{"key":"1_CR15","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 Informatique th\u00e9orique\/Theoretical Computer Science\u00a012, 319\u2013337 (1978)","journal-title":"RAIRO Informatique th\u00e9orique\/Theoretical Computer Science"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Elgot, C.: Monadic computation and iterative algebraic theories. In: Shepherdson, J.C. (ed.) Logic Colloquium 1973, Studies in Logic, vol.\u00a080, North Holland, Amsterdam (1975)","DOI":"10.1016\/S0049-237X(08)71949-9"},{"key":"1_CR17","first-page":"183","volume":"14","author":"Z. \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Identities in Iterative and rational theories. Computational Linguistics and Computer Languages\u00a014, 183\u2013207 (1980)","journal-title":"Computational Linguistics and Computer Languages"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Labella, A.: Equational properties of iteration in algebraically complete categories. In: Selected papers from the 21st symposium on Mathematical foundations of computer science MFCS 1996. Theoretical Computer Science, vol.\u00a0195, pp. 61\u201389 (1998)","DOI":"10.1016\/S0304-3975(97)00158-8"},{"key":"1_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)","edition":"2"},{"key":"1_CR20","first-page":"131","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. Theoretical Informatics and Applications\u00a014, 131\u2013141 (1980)","journal-title":"Theoretical Informatics and Applications"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"1_CR22","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"Nivat, M.: On the interpretation of recursive polyadic program schemes. Symposia Mathematica\u00a015, 255\u2013281 (1975)","journal-title":"Symposia Mathematica"},{"key":"1_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.: Varieties of Formal Languages. Plenum Publishing Corp. New York (1986)"},{"key":"1_CR24","volume-title":"Linear Orderings","author":"J.B. Rosenstein","year":"1982","unstructured":"Rosenstein, J.B.: Linear Orderings. Academic Press, New York (1982)"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D.: Data types as lattices. SIAM J. Computing\u00a05, 522\u2013587 (1976)","journal-title":"SIAM J. Computing"},{"key":"1_CR26","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 trees. Theoretical Informatics and Applications\u00a020, 371\u2013381 (1986)","journal-title":"Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73859-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:17:19Z","timestamp":1683998239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73859-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738572"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6_1","relation":{},"subject":[]}}