{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:11:09Z","timestamp":1748664669663,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319251493"},{"type":"electronic","value":"9783319251509"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25150-9_9","type":"book-chapter","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T11:42:36Z","timestamp":1443181356000},"page":"126-143","source":"Crossref","is-referenced-by-count":1,"title":["Inverse Monoids of Higher-Dimensional Strings"],"prefix":"10.1007","author":[{"given":"David","family":"Janin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.tcs.2005.07.002","volume":"347","author":"S Abramsky","year":"2005","unstructured":"Abramsky, S.: A structural approach to reversible computation. Theor. Comp. Sci. 347(3), 441\u2013464 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B - System and Software Engineering","author":"J-R Abrial","year":"2010","unstructured":"Abrial, J.-R.: Modeling in Event-B - System and Software Engineering. Cambridge University Press, Cambridge (2010)"},{"issue":"4","key":"9_CR3","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. Int. J. Semant. Comput. 6(4), 409\u2013427 (2012)","journal-title":"Int. J. Semant. Comput."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jvlc.2012.10.002","volume":"24","author":"C Blume","year":"2013","unstructured":"Blume, C., Bruggink, H.J.S., Friedrich, M., K\u00f6nig, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Visual Lang. Comput. 24(3), 192\u2013206 (2013)","journal-title":"J. Visual Lang. Comput."},{"issue":"161","key":"9_CR5","first-page":"1","volume":"91","author":"A Blumensath","year":"2014","unstructured":"Blumensath, A., Janin, D.: A syntactic congruence for languages of birooted trees. Semigroup Forum 91(161), 1\u201324 (2014)","journal-title":"Semigroup Forum"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","volume-title":"Graph Transformations","author":"HJS Bruggink","year":"2008","unstructured":"Bruggink, H.J.S., K\u00f6nig, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336\u2013350. Springer, Heidelberg (2008)"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1515\/9783112720875","volume-title":"A Model Theoretic Oriented Approach to Partial Algebras","author":"P Burmeister","year":"1986","unstructured":"Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras. Akademie-Verlag, Berlin (1986)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theor. Comp. Sci. 80(2), 153\u2013202 (1991)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-order Logic, A Language Theoretic Approach, of Encyclopedia of Mathematics and its Applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-order Logic, A Language Theoretic Approach, of Encyclopedia of Mathematics and its Applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"issue":"1\u20132","key":"9_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(99)00049-3","volume":"227","author":"V Danos","year":"1999","unstructured":"Danos, V., Regnier, L.: Reversible, irreversible and optimal lambda-machines. Theor. Comp. Sci. 227(1\u20132), 79\u201397 (1999)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00233-008-9060-x","volume":"77","author":"V Diekert","year":"2008","unstructured":"Diekert, V., Lohrey, M., Miller, A.: Partially commutative inverse monoids. Semigroup Forum 77(2), 196\u2013226 (2008)","journal-title":"Semigroup Forum"},{"key":"9_CR12","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. J. Algebra Comput. 19, 527\u2013554 (2009)","journal-title":"Int. J. Algebra Comput."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT 1997, Selected Papers, pp. 223\u2013237 (1997)","DOI":"10.1007\/3-540-64299-4_36"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Hudak, P., Janin, D.: Tiled polymorphic temporal media. In: Work on Functional Art, Music, Modeling and Design (FARM), pp. 49\u201360. ACM Press (2014)","DOI":"10.1145\/2633638.2633649"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 7966, pp. 312\u2013323. Springer, Heidelberg (2013)"},{"key":"9_CR16","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. 7913, pp. 431\u2013443. Springer, Heidelberg (2013)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ic.2014.12.016","volume":"243","author":"D Janin","year":"2014","unstructured":"Janin, D.: On languages of labeled birooted trees: algebras, automata and logic. Inf. Comput. 243, 222\u2013248 (2014)","journal-title":"Inf. Comput."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 8327, pp. 7\u201320. Springer, Heidelberg (2014)"},{"key":"9_CR19","unstructured":"Janin, D.: Free inverse monoids up to rewriting. Research report, LaBRI, Universit\u00e9 de Bordeaux (2015)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Janin, D.: Walking automata in the free inverse monoid. Research report, LaBRI, Universit\u00e9 de Bordeaux (2015)","DOI":"10.1007\/978-3-662-49192-8_26"},{"key":"9_CR21","unstructured":"Janin, D., Berthaut, F., Desainte-Catherine, M.: Multi-scale design of interactive music systems: the libTuiles experiment. In: Sound and Music Computing (SMC) (2013)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Janin, D., Berthaut, F., DeSainte-Catherine, M., Orlarey, Y., Salvati, S.: The T-calculus: towards a structured programming of (musical) time and space. In: Work on Functional Art, Music, Modeling and Design (FARM), pp. 23\u201334. ACM Press (2013)","DOI":"10.1145\/2505341.2505347"},{"key":"9_CR23","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. 187, 115\u2013157 (1997)","journal-title":"Comm. Math. Phys."},{"issue":"1","key":"9_CR24","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. J. Algebra 224(1), 140\u2013150 (2000)","journal-title":"J. Algebra"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.jalgebra.2004.01.029","volume":"276","author":"J Kellendonk","year":"2004","unstructured":"Kellendonk, J., Lawson, M.V.: Universal groups for point-sets and tilings. J. Algebra 276, 462\u2013492 (2004)","journal-title":"J. Algebra"},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1142\/3645","volume-title":"Inverse Semigroups: The Theory of Partial Symmetries","author":"MV Lawson","year":"1998","unstructured":"Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, River Edge (1998)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Lewis, H.R.: A new decidable problem, with applications (extended abstract). In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 62\u201373. IEEE Press (1977)","DOI":"10.1109\/SFCS.1977.2"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-4049(89)90052-2","volume":"58","author":"SW Margolis","year":"1989","unstructured":"Margolis, S.W., Meakin, J.C.: E-unitary inverse monoids and the Cayley graph of a group presentation. J. Pure Appl. Algebra 58, 46\u201376 (1989)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Meakin, J.: Groups and semigroups: connections and contrasts. In: Groups St Andrews 2005, London Mathematical Society, Lecture Note Series 340, vol. 2. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511721205.002"},{"key":"9_CR30","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. Ann. Math. 102, 379\u2013419 (1975)","journal-title":"Ann. Math."},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-4049(90)90057-O","volume":"63","author":"JB Stephen","year":"1990","unstructured":"Stephen, J.B.: Presentations of inverse monoids. J. Pure Appl. Algebra 63, 81\u2013112 (1990)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-63246-8_8","volume-title":"Structures in Logic and Computer Science","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 118\u2013143. Springer, Heidelberg (1997)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-44577-3_18","volume-title":"Informatics","author":"W Thomas","year":"2001","unstructured":"Thomas, W.: Logic for computer science: the engineering challenge. In: Wilhelm, R. (ed.) Informatics. LNCS, vol. 2000, pp. 257\u2013267. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25150-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T20:17:08Z","timestamp":1748636228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25150-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319251493","9783319251509"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25150-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}