{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T14:06:15Z","timestamp":1791209175044,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392115","type":"print"},{"value":"9783642392122","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_29","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"312-323","source":"Crossref","is-referenced-by-count":9,"title":["Algebras, Automata and Logic for Languages of Labeled Birooted Trees"],"prefix":"10.1007","author":[{"given":"David","family":"Janin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"29","key":"29_CR1","doi-asserted-by":"publisher","first-page":"3463","DOI":"10.1016\/j.tcs.2011.02.037","volume":"412","author":"A. Blumensath","year":"2011","unstructured":"Blumensath, A.: Recognisability for algebras of infinite trees. Theor. Comput. Sci.\u00a0412(29), 3463\u20133486 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Straubing, H., Walukiewicz, I.: Wreath products of forest algebras, with applications to tree logics. Logical Methods in Computer Science\u00a08(3) (2012)","DOI":"10.2168\/LMCS-8(3:19)2012"},{"key":"29_CR3","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest algebras. In: Logic and Automata, pp. 107\u2013132 (2008)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1016\/j.jpaa.2011.10.015","volume":"216","author":"C. Cornock","year":"2012","unstructured":"Cornock, C., Gould, V.: Proper two-sided restriction semigroups and partial actions. Journal of Pure and Applied Algebra\u00a0216, 935\u2013949 (2012)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"29_CR5","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.\u00a02914, pp. 195\u2013207. Springer, Heidelberg (2003)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-642-32589-2_46","volume-title":"Mathematical Foundations of Computer Science 2012","author":"D. Janin","year":"2012","unstructured":"Janin, D.: Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 516\u2013528. Springer, Heidelberg (2012)"},{"key":"29_CR7","unstructured":"Janin, D.: Walking automata in the free inverse monoid. Technical Report RR-1464-12 (revised April 2013), LaBRI, Universit\u00e9 de Bordeaux (2012)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-35843-2_22","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"D. Janin","year":"2013","unstructured":"Janin, D.: On languages of one-dimensional overlapping tiles. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 244\u2013256. Springer, Heidelberg (2013)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-642-38536-0_37","volume-title":"8th International Computer Science Symposium in Russia (CSR)","author":"D. Janin","year":"2013","unstructured":"Janin, D.: Overlapping tile automata. In: Bulatov, A. (ed.) CSR 2013. LNCS, vol.\u00a07913, pp. 431\u2013443. Springer, Heidelberg (2013)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1006\/jabr.1999.8120","volume":"224","author":"J. Kellendonk","year":"2000","unstructured":"Kellendonk, J., Lawson, M.V.: Tiling semigroups. Journal of Algebra\u00a0224(1), 140\u2013150 (2000)","journal-title":"Journal of Algebra"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1006\/jabr.1997.7301","volume":"202","author":"M.V. Lawson","year":"1998","unstructured":"Lawson, M.V.: McAlister semigroups. Journal of Algebra\u00a0202(1), 276\u2013294 (1998)","journal-title":"Journal of Algebra"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Perrin, D., Pin, J.-E.: Semigroups and automata on infinite words. In: Fountain, J. (ed.) Semigroups, Formal Languages and Groups. NATO Advanced Study Institute, pp. 49\u201372. Kluwer Academic (1995)","DOI":"10.1007\/978-94-011-0149-3_3"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BFb0013110","volume-title":"Formal Properties of Finite Automata and Applications","author":"J.-E. Pin","year":"1989","unstructured":"Pin, J.-E.: Relational morphisms, transductions and operations on languages. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol.\u00a0386, pp. 34\u201355. Springer, Heidelberg (1989)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Pin, J.-E.: Finite semigroups and recognizable languages: an introduction. In: Fountain, J. (ed.) Semigroups, Formal Languages and Groups. NATO Advanced Study Institute, pp. 1\u201332. Kluwer Academic (1995)","DOI":"10.1007\/978-94-011-0149-3_1"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Pin, J.-.E.: Syntactic semigroups. In: Handbook of Formal Languages, ch. 10, vol.\u00a0I, pp. 679\u2013746. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02570809","volume":"4","author":"H.E. Scheiblich","year":"1972","unstructured":"Scheiblich, H.E.: Free inverse semigroups. Semigroup Forum\u00a04, 351\u2013359 (1972)","journal-title":"Semigroup Forum"},{"key":"29_CR17","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 of Mathematics\u00a0102, 379\u2013419 (1975)","journal-title":"Annals of Mathematics"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, ch. 7, vol.\u00a0III, pp. 389\u2013455. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Alg. Comput.\u00a03, 447\u2013489 (1993)","journal-title":"Int. J. Alg. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:37:17Z","timestamp":1557898637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}