{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:20Z","timestamp":1725560960401},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_5","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"50-61","source":"Crossref","is-referenced-by-count":0,"title":["Axioms for Regular Words"],"prefix":"10.1007","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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":"5_CR2","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 Informaticae\u00a055, 1\u201321 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR3","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing omega and omega-op powers on words (to appear)"},{"key":"5_CR4","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":"5_CR5","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":"5_CR6","volume-title":"Recursiveness","author":"S. Eilenberg","year":"1970","unstructured":"Eilenberg, S., Elgot, C.: Recursiveness. Academic Press, New York (1970)"},{"key":"5_CR7","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":"5_CR8","volume-title":"Linear Orderings","author":"J.B. Rosenstein","year":"1982","unstructured":"Rosenstein, J.B.: Linear Orderings. Academic Press, New York (1982)"},{"key":"5_CR9","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","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:45:56Z","timestamp":1558298756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}