{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:50:53Z","timestamp":1724449853765},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00224-013-9489-5","type":"journal-article","created":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T08:29:10Z","timestamp":1375259350000},"page":"111-148","source":"Crossref","is-referenced-by-count":7,"title":["Word-Mappings of Level 2"],"prefix":"10.1007","volume":"54","author":[{"given":"Julien","family":"Fert\u00e9","sequence":"first","affiliation":[]},{"given":"Nathalie","family":"Marin","sequence":"additional","affiliation":[]},{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,1]]},"reference":[{"key":"9489_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Leipzig (1979)"},{"key":"9489_CR2","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., Otto, F.: String Rewriting Systems. Texts and Monographs in Computer Science. Springer, Berlin (1993)"},{"key":"9489_CR3","unstructured":"Braud, L.: The structure of order in the pushdown hierarchy. Les structures d\u2019ordre dans la hi\u00e9rarchie \u00e0 pile. Th\u00e8se de doctorat, Universit\u00e9 Paris-Est (Juin 2010)"},{"key":"9489_CR4","series-title":"LNCS","first-page":"88","volume-title":"Proceedings ICALP\u201910","author":"L. Braud","year":"2010","unstructured":"Braud, L., Carayol, A.: Linear orders in the pushdown hierarchy. In: Proceedings ICALP\u201910. LNCS, vol. 6199, pp. 88\u201399. Springer, Berlin (2010)"},{"key":"9489_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80016-X","volume":"71","author":"W. Damm","year":"1986","unstructured":"Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Inf. Control 71, 1\u201332 (1986)","journal-title":"Inf. Control"},{"key":"9489_CR6","first-page":"387","volume-title":"Algebraic Combinatorics on Words","author":"V. Diekert","year":"2002","unstructured":"Diekert, V.: Makanin\u2019s algorithm. In: Algebraic Combinatorics on Words, pp. 387\u2013438. Cambridge University Press, Cambridge (2002). Chap.\u00a012"},{"key":"9489_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational sets in commutative monoids. J. Algebra 13, 173\u2013191 (1969)","journal-title":"J. Algebra"},{"key":"9489_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(86)90052-6","volume":"42","author":"J. Engelfriet","year":"1986","unstructured":"Engelfriet, J., Vogler, H.: Pushdown machines for the macro tree transducers. Theor. Comput. Sci. 42, 251\u2013368 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9489_CR9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J.\u00a0Comput. Syst. Sci. 20(2), 150\u2013202 (1980). ACM-SIGACT Symposium on the Theory of Computing (San Diego, CA, 1978)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"3","key":"9489_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.apal.2005.12.004","volume":"141","author":"S. Fratani","year":"2006","unstructured":"Fratani, S., S\u00e9nizergues, G.: Iterated pushdown automata and sequences of rational numbers. Ann. Pure Appl. Log. 141(3), 363\u2013411 (2006)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1\u20132","key":"9489_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(96)00244-7","volume":"163","author":"R.H. Gilman","year":"1996","unstructured":"Gilman, R.H.: A shrinking lemma for indexed languages. Theor. Comput. Sci. 163(1\u20132), 277\u2013281 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9489_CR12","unstructured":"Guedj, M.: Equations et langages formels, le cas quadratique. Master Thesis, Bordeaux 1 University (2007)"},{"key":"9489_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2977\/prims\/1195192738","volume":"9","author":"T. Hayashi","year":"1973","unstructured":"Hayashi, T.: On derivation tress of index grammars: an extension of the uvwxy-theorem. Publ. RIMS Kyoto Univ. 9, 61\u201392 (1973)","journal-title":"Publ. RIMS Kyoto Univ."},{"issue":"4","key":"9489_CR14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"key":"9489_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-642-59136-5_5","volume-title":"Handbook of Formal Languages","author":"L. Kari","year":"1997","unstructured":"Kari, L., Rozenberg, G., Salomaa, A.: L systems. In: Handbook of Formal Languages, vol.\u00a01, pp.\u00a0253\u2013328. Springer, Berlin (1997)"},{"key":"9489_CR16","unstructured":"Lisovik, L.P., Karnaukh, T.A.: On a class of functions computable by index grammars. Kibernet. Sistem. Anal. (1), 108\u2013115, 191 (2003)"},{"key":"9489_CR17","unstructured":"Makanin, G.S.: The problem of the solvability of equations in a free semigroup. Mat. Sb. (N. S.) 103(145)(2), 147\u2013236, 319 (1977)"},{"key":"9489_CR18","first-page":"1170","volume":"15","author":"A.N. Maslov","year":"1974","unstructured":"Maslov, A.N.: The hierarchy of indexed languages of an arbitrary level. Sov. Math. Dokl. 15, 1170\u20131174 (1974)","journal-title":"Sov. Math. Dokl."},{"key":"9489_CR19","first-page":"38","volume":"12","author":"A.N. Maslov","year":"1976","unstructured":"Maslov, A.N.: Multilevel stack automata. Probl. Pereda. Inf. 12, 38\u201343 (1976)","journal-title":"Probl. Pereda. Inf."},{"key":"9489_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1145\/1132516.1132584","volume-title":"STOC\u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"W. Plandowski","year":"2006","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations (extended abstract). In: STOC\u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 467\u2013476. ACM, New York (2006)"},{"key":"9489_CR21","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates. Vuibert Informatique (2003)"},{"key":"9489_CR22","first-page":"621","volume-title":"Proceedings of STACS 2008","author":"J. Sakarovitch","year":"2008","unstructured":"Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Proceedings of STACS 2008, pp. 621\u2013632 (2008)"},{"key":"9489_CR23","first-page":"281","volume":"3","author":"M.-P. Sch\u00fctzenberger","year":"1970","unstructured":"Sch\u00fctzenberger, M.-P.: Parties rationnelles d\u2019un mono\u00efde libre. Congr. Int. Math. 3, 281\u2013282 (1970)","journal-title":"Congr. Int. Math."},{"key":"9489_CR24","series-title":"LNCS","first-page":"24","volume-title":"Proceedings CSR\u201907","author":"G. S\u00e9nizergues","year":"2007","unstructured":"S\u00e9nizergues, G.: Sequences of level 1,2,3,\u2026,k. In: Proceedings CSR\u201907. LNCS, vol.\u00a04649, pp.\u00a024\u201332. Springer, Berlin (2007). Invited talk at CSR\u201907"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9489-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9489-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9489-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T15:20:40Z","timestamp":1688397640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9489-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9489"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9489-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,1]]}}}