{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:01:42Z","timestamp":1762459302507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_1","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Recognisable Languages over Monads"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s00224-013-9464-1","volume":"53","author":"M Bojanczyk","year":"2013","unstructured":"Bojanczyk, M.: Nominal monoids. Theory Comput. Syst. 53(2), 194\u2013222 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jcss.2011.06.003","volume":"78","author":"N Bedon","year":"2012","unstructured":"Bedon, N., Rispal, C.: Sch\u00fctzenberger and Eilenberg theorems for words on linear orderings. J. Comput. Syst. Sci. 78(2), 517\u2013536 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR3","unstructured":"Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas], pp. 107\u2013132 (2008)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-22012-8_9","volume-title":"Automata, Languages and Programming","author":"O Carton","year":"2011","unstructured":"Carton, O., Colcombet, T., Puppis, G.: Regular languages of words over countable linear orderings. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 125\u2013136. Springer, Heidelberg (2011)"},{"key":"1_CR5","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol. A (1974)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jlap.2009.10.001","volume":"79","author":"Z \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages. The Journal of Logic and Algebraic Programming 79(2), 189\u2013213 (2010)","journal-title":"The Journal of Logic and Algebraic Programming"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-24597-1_17","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Z \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Weil, P.: On logically defined recognizable tree languages. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 195\u2013207. Springer, Heidelberg (2003)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-14162-1_13","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2010","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: A topological approach to recognition. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 151\u2013162. Springer, Heidelberg (2010)"},{"key":"1_CR10","unstructured":"Toru\u0144czyk, S., Boja\u0144czyk, M., Parys, P.: The mso+u theory of \n$$({\\mathbb{N}},<)$$\n is undecidable (2015). CoRR, arXiv:1502.04578"},{"key":"1_CR11","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite Words: Automata, Semigroups, Logic and Games. Elsevier (2004)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02483902","volume":"14","author":"J Reiterman","year":"1982","unstructured":"Reiterman, J.: The Birkhoff theorem for finite algebras. Algebra Universalis 14(1), 1\u201310 (1982)","journal-title":"Algebra Universalis"},{"key":"1_CR13","unstructured":"Steinby, M.: A theory of tree language varieties. In: Tree Automata and Languages, pp. 57\u201382 (1992)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-31585-5_35","volume-title":"Automata, Languages, and Programming","author":"S Toru\u0144czyk","year":"2012","unstructured":"Toru\u0144czyk, S.: Languages of profinite words and the limitedness problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 377\u2013389. Springer, Heidelberg (2012)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 infinity-languages. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 588\u2013599. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:09:05Z","timestamp":1675865345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}