{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:18Z","timestamp":1760079318504},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745099"},{"type":"electronic","value":"9783540745105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74510-5_6","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T15:11:35Z","timestamp":1187709095000},"page":"24-32","source":"Crossref","is-referenced-by-count":3,"title":["Sequences of Level 1, 2, 3,..., k,..."],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars-an extension of context-free grammars. J. Assoc. for Comput. Mach.\u00a015, 647\u2013671 (1968)","journal-title":"J. Assoc. for Comput. Mach."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","volume":"16","author":"A.V. Aho","year":"1969","unstructured":"Aho, A.V.: Nested stack automata. J. Assoc. for Comput. Mach.\u00a016, 383\u2013406 (1969)","journal-title":"J. Assoc. for Comput. Mach."},{"key":"6_CR3","unstructured":"Berstel, J.: Personnal communication (2003)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"Damm, W.: The IO- and OI-hierarchies. TCS\u00a020, 95\u2013207 (1982)","journal-title":"TCS"},{"key":"6_CR7","doi-asserted-by":"publisher","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. Information and control\u00a071, 1\u201332 (1986)","journal-title":"Information and control"},{"key":"6_CR8","first-page":"365","volume-title":"Theory Comput., Assoc. Comp Mach.","author":"J. Engelfriet","year":"1983","unstructured":"Engelfriet, J.: Iterated pushdown automata and complexity classes. In: Theory Comput., Assoc. Comp Mach. Proc. 15th Annu ACM Sympos, pp. 365\u2013373. ACM Press, New York (1983)"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J., Schmidt, E.M.: IO and OI. I. J. Comput. System Sci.\u00a015(3), 328\u2013353 (1977)","journal-title":"J. Comput. System Sci."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0022-0000(84)90006-0","volume":"29","author":"J. Engelfriet","year":"1984","unstructured":"Engelfriet, J., Slutski, G.: Extended macro grammars and stack controlled machines. Journal of Computer and System sciences\u00a029, 366\u2013408 (1984)","journal-title":"Journal of Computer and System sciences"},{"key":"6_CR11","doi-asserted-by":"publisher","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 transducer. TCS\u00a042, 251\u2013368 (1986)","journal-title":"TCS"},{"key":"6_CR12","unstructured":"Fischer, M.J.: Grammars with macro-like productions. PhD thesis, Harvard University (1968). See also: In: Proc. 9th Symp. on Switching and Automata Theory, pp. 131\u2013142 (1968)"},{"key":"6_CR13","unstructured":"Fratani, S.: Automates \u00e0 piles de piles.. de piles. PhD thesis, Bordeaux 1 university (2005)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","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. Logic\u00a0141(3), 363\u2013411 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Greibach, S.: Full AFL\u2019s and nested iterated substitution. Information and Control, 7\u201335 (1970)","DOI":"10.1016\/S0019-9958(70)80039-0"},{"issue":"1-2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(00)00158-4","volume":"244","author":"J. Honkala","year":"2000","unstructured":"Honkala, J.: A short solution for the HDT0L sequence equivalence problem. Theoret. Comput. Sci.\u00a0244(1-2), 267\u2013270 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"FoSSaCs 2002","author":"T. Knapik","year":"2002","unstructured":"Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: FoSSaCs 2002. LNCS, Springer, Heidelberg (2002)"},{"key":"6_CR18","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. 253\u2013328. Springer, Heidelberg (1997)"},{"key":"6_CR19","unstructured":"Marin, N.: Suites de mots et automates. Master thesis. Bordeaux 1 university, pp. 1\u201340 (2007)"},{"key":"6_CR20","first-page":"1170","volume":"15","author":"A.N. Maslov","year":"1974","unstructured":"Maslov, A.N.: The hierarchy of indexed languages of an arbitrary level. Soviet. Math. Dokl.\u00a015, 1170\u20131174 (1974)","journal-title":"Soviet. Math. Dokl."},{"key":"6_CR21","first-page":"38","volume":"12","author":"A.N. Maslov","year":"1976","unstructured":"Maslov, A.N.: Multilevel stack automata. Problemy Peredachi Informatsii\u00a012, 38\u201343 (1976)","journal-title":"Problemy Peredachi Informatsii"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"6_CR23","volume-title":"A\u2009=\u2009B","author":"M. Petkov\u0161ek","year":"1996","unstructured":"Petkov\u0161ek, M., Wilf, H.S., Zeilberger, D.: A\u2009=\u2009B. A K Peters Ltd, Wellesley, MA (1996)"},{"key":"6_CR24","unstructured":"S\u00e9nizergues, G.: T(A) = T(B)? In: van Emde\u00a0Boas, P., Wiedermann, J., Nielsen, M. (eds.) Proceedings ICALP\u201999, vol. 1644, pp. 665\u2013675. Lecture Notes in Computer Science (1999). Detailed version in technical report 1209-99, pp. 1\u201361. Can be accessed at \n                  \n                    http:\/\/www.labri.u-bordeaux.fr\/~ges"},{"key":"6_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0195-6698(80)80051-5","volume":"1","author":"R.P. Stanley","year":"1980","unstructured":"Stanley, R.P.: Differentiably finite power series. European Journal of Combinatorics\u00a01, 175\u2013188 (1980)","journal-title":"European Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74510-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:21:59Z","timestamp":1619518919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74510-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745099","9783540745105"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74510-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}