{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:34Z","timestamp":1725798874721},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_30","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"339-347","source":"Crossref","is-referenced-by-count":1,"title":["Embedding Finite and Infinite Words into Overlapping Tiles"],"prefix":"10.1007","author":[{"given":"Anne","family":"Dicky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Janin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1142\/S1793351X12400132","volume":"6","author":"F. Berthaut","year":"2012","unstructured":"Berthaut, F., Janin, D., Martin, B.: Advanced synchronization of audio or symbolic musical patterns: an algebraic approach. International Journal of Semantic Computing\u00a06(4), 409\u2013427 (2012), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00794196","journal-title":"International Journal of Semantic Computing"},{"issue":"29","key":"30_CR2","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. Theoretical Comp. Science\u00a0412(29), 3463\u20133486 (2011)","journal-title":"Theoretical Comp. Science"},{"key":"30_CR3","unstructured":"Dicky, A., Janin, D.: Two-way automata and regular languages of overlapping tiles. Research report RR-1463-12, LaBRI, Universit\u00e9 de Bordeaux (2013), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00717572"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-319-04921-2_27","volume-title":"Language and Automata Theory and Applications","author":"E. Dubourg","year":"2014","unstructured":"Dubourg, E., Janin, D.: Algebraic tools for the overlapping tile product. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.\u00a08370, pp. 335\u2013346. Springer, Heidelberg (2014), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00879465"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1006\/jabr.1999.7871","volume":"218","author":"J. Fountain","year":"1999","unstructured":"Fountain, J., Gomes, G., Gould, V.: A Munn type representation for a class of E-semiadequate semigroups. Journal of Algebra\u00a0218, 693\u2013714 (1999)","journal-title":"Journal of Algebra"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1142\/S0218196709005214","volume":"19","author":"J. Fountain","year":"2009","unstructured":"Fountain, J., Gomes, G., Gould, V.: The free ample monoid. Int. Jour. of Algebra and Computation\u00a019, 527\u2013554 (2009)","journal-title":"Int. Jour. of Algebra and Computation"},{"key":"30_CR7","unstructured":"Hudak, P.: A sound and complete axiomatization of polymorphic temporal media. Tech. Rep. RR-1259, Department of Computer Science, Yale University (2008)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Hudak, P., Hugues, J., Peyton Jones, S., Wadler, P.: A history of Haskell: Being lazy with class. In: Third ACM SIGPLAN History of Programming Languages (HOPL). ACM Press (2007)","DOI":"10.1145\/1238844.1238856"},{"key":"30_CR9","unstructured":"Hudak, P., Janin, D.: Tiled polymorphic temporal media. Research report RR-1478-14, LaBRI, Universit\u00e9 de Bordeaux (2014), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00955113"},{"key":"30_CR10","unstructured":"Janin, D.: Quasi-inverse monoids (and premorphisms). Research report RR-1459-12, LaBRI, Universit\u00e9 de Bordeaux (2012), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00673123"},{"key":"30_CR11","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), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00671917"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-39212-2_29","volume-title":"Automata, Languages, and Programming","author":"D. Janin","year":"2013","unstructured":"Janin, D.: Algebras, automata and logic for languages of labeled birooted trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 312\u2013323. Springer, Heidelberg (2013), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00784898"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00659202"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-38536-0_37","volume-title":"Computer Science \u2013 Theory and Applications","author":"D. Janin","year":"2013","unstructured":"Janin, D.: Overlapping tile automata. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 431\u2013443. Springer, Heidelberg (2013)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Janin, D.: On languages of labeled birooted trees: Algebras, automata and logic. Information and Computation (in print, 2014), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00982538","DOI":"10.1016\/j.ic.2014.12.016"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-3-319-04298-5_2","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"D. Janin","year":"2014","unstructured":"Janin, D.: Towards a higher dimensional string theory for the modeling of computerized systems. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol.\u00a08327, pp. 7\u201320. Springer, Heidelberg (2014)"},{"key":"30_CR17","unstructured":"Janin, D., Berthaut, F., DeSainte-Catherine, M., Orlarey, Y., Salvati, S.: The T-calculus\u00a0: towards a structured programming of (musical) time and space. In: ACM Workshop on Functional Art, Music, Modeling and Design (FARM), pp. 23\u201334. ACM Press (2013), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00789189"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002200050131","volume":"187","author":"J. Kellendonk","year":"1997","unstructured":"Kellendonk, J.: The local structure of tilings and their integer group of coinvariants. Comm. Math. Phys.\u00a0187, 115\u2013157 (1997)","journal-title":"Comm. Math. Phys."},{"issue":"1","key":"30_CR19","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":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0021-8693(91)90242-Z","volume":"141","author":"M.V. Lawson","year":"1991","unstructured":"Lawson, M.V.: Semigroups and ordered categories. I. the reduced case. Journal of Algebra\u00a0141(2), 422\u2013462 (1991)","journal-title":"Journal of Algebra"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Lawson, M.V.: Inverse Semigroups: The theory of partial symmetries. World Scientific (1998)","DOI":"10.1142\/3645"},{"issue":"1","key":"30_CR22","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":"30_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1090\/S0002-9947-1973-0327952-0","volume":"182","author":"D. McAlister","year":"1973","unstructured":"McAlister, D.: Inverse semigroups which are separated over a subsemigroups. Trans. Amer. Math. Soc.\u00a0182, 85\u2013117 (1973)","journal-title":"Trans. Amer. Math. Soc."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Muller, D.: Infinite sequences and finite machines. In: Fourth Annual Symp. IEEE, Switching Theory and Logical Design, pp. 3\u201316 (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"30_CR25","unstructured":"Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.\u00a0141. Elsevier (2004)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:07:45Z","timestamp":1558973265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}