{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:39Z","timestamp":1725846819111},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_26","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"314-328","source":"Crossref","is-referenced-by-count":1,"title":["Walking Automata in Free Inverse Monoids"],"prefix":"10.1007","author":[{"given":"David","family":"Janin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88282-4_1","volume-title":"Language and Automata Theory and Applications","author":"M Boja\u0144czyk","year":"2008","unstructured":"Boja\u0144czyk, M.: Tree-walking automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 1\u20132. Springer, Heidelberg (2008)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC, ACM (2005)","DOI":"10.1145\/1060590.1060626"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11786986_15","volume-title":"Automata, Languages and Programming","author":"M Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive power of pebble automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 157\u2013168. Springer, Heidelberg (2006)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic, a language theoretic approach, vol. 138 of Encyclopedia of mathematics and its applications. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2015-1282","volume":"142","author":"A Dicky","year":"2015","unstructured":"Dicky, A., Janin, D.: Two-way automata and regular languages of overlapping tiles. Fundamenta Informaticae 142, 1\u201333f (2015)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Hoogeboom, H.J., Samwel, B.: XML transformation by tree-walking transducers with invisible pebbles. In: Principles of Database System (PODS). ACM (2007)","DOI":"10.1145\/1265530.1265540"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-60207-8_7","volume-title":"Jewels are Forever: Contributions to Theoretical Computer Science in Honor of Arto Salomaa","author":"J Engelfriet","year":"1999","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhum\u00e4ki, J., Maurer, H., Paun, G., Rozenberg, G. (eds.) Jewels are Forever: Contributions to Theoretical Computer Science in Honor of Arto Salomaa, pp. 72\u201383. Springer, Heidelberg (1999)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/11672142_39","volume-title":"STACS 2006","author":"J Engelfriet","year":"2006","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Nested pebbles and transitive closure. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 477\u2013488. Springer, Heidelberg (2006)"},{"key":"26_CR9","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. 7464, pp. 516\u2013528. Springer, Heidelberg (2012)"},{"key":"26_CR10","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: Kwiatkowska, M., Peleg, D., Fomin, F.V., Freivalds, R. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 312\u2013323. Springer, Heidelberg (2013)"},{"key":"26_CR11","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. 7741, pp. 244\u2013256. Springer, Heidelberg (2013)"},{"key":"26_CR12","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":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-25150-9_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"D Janin","year":"2015","unstructured":"Janin, D.: Inverse monoids of higher-dimensional strings. In: Leucker, M., et al. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 126\u2013143. Springer, Heidelberg (2015)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ic.2014.12.016","volume":"243","author":"D Janin","year":"2015","unstructured":"Janin, D.: On labeled birooted trees languages: Algebras, automata and logic. Inf. Comput. 243, 222\u2013248 (2015)","journal-title":"Inf. Comput."},{"key":"26_CR15","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 and Appl. Algebra 58, 46\u201376 (1989)","journal-title":"J. Pure and Appl. Algebra"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Meakin, J.: Groups and semigroups: connections and contrasts. In: Groups St Andrews 2005, vol. 2. London Mathematical Society, Lecture Note Series 340. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511721205.002"},{"key":"26_CR17","volume-title":"Communication and concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"1","key":"26_CR18","first-page":"71","volume":"19","author":"J-P P\u00e9cuchet","year":"1985","unstructured":"P\u00e9cuchet, J.-P.: Automates boustrophedon, semi-groupe de Birget et monoide inversif libre. ITA 19(1), 71\u2013100 (1985)","journal-title":"ITA"},{"issue":"4","key":"26_CR19","first-page":"349","volume":"30","author":"PV Silva","year":"1996","unstructured":"Silva, P.V.: On free inverse monoid languages. ITA 30(4), 349\u2013378 (1996)","journal-title":"ITA"},{"key":"26_CR20","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"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T11:56:15Z","timestamp":1692186975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}