{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:26:05Z","timestamp":1676420765102},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T00:00:00Z","timestamp":1191369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T00:00:00Z","timestamp":1191369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00224-007-9053-2","type":"journal-article","created":{"date-parts":[[2007,10,2]],"date-time":"2007-10-02T15:36:15Z","timestamp":1191339375000},"page":"157-186","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Storage Products and Linear Control of Derivations"],"prefix":"10.1007","volume":"42","author":[{"given":"Christian","family":"Wartena","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,3]]},"reference":[{"issue":"3","key":"9053_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0129054196000191","volume":"7","author":"L. Breveglieri","year":"1996","unstructured":"Breveglieri, L., Cherubini, A., Citrini, C., Crespi Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci. 7(3), 253\u2013291 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9053_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-08442-8_70","volume-title":"Fundamentals of Computation Theory","author":"L. Budach","year":"1977","unstructured":"Budach, L.: Environments, labyrinths and automata. In: Karpi\u0144ski, M. (ed.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol.\u00a056, pp.\u00a054\u201364. Springer, Berlin (1977)"},{"key":"9053_CR3","unstructured":"Budach, L.: Personal communication (1999)"},{"issue":"Supplement","key":"9053_CR4","first-page":"625","volume":"54","author":"A. Cherubini","year":"1999","unstructured":"Cherubini, A., San Pietro, P.: On the relation between multi-depth grammars and tree-adjoining grammars. Publ. Math. Debrecen 54(Supplement), 625\u2013640 (1999)","journal-title":"Publ. Math. Debrecen"},{"key":"9053_CR5","volume-title":"Algebraic Engineering","author":"A. Cherubini","year":"1999","unstructured":"Cherubini, A., San Pietro, P.: On the relations between multi-depth grammars and label-distinguished control grammars. In: Nehaniv, C.L., Ito, M. (eds.) Algebraic Engineering. World Scientific, Singapore (1999)"},{"issue":"4","key":"9053_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s002240010004","volume":"33","author":"A. Cherubini","year":"2000","unstructured":"Cherubini, A., San Pietro, P.: Tree adjoining languages and multipushdown languages. Theory Comput. Syst. 33(4), 257\u2013293 (2000)","journal-title":"Theory Comput. Syst."},{"key":"9053_CR7","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1006\/jcss.1998.1610","volume":"58","author":"J. Dassow","year":"1999","unstructured":"Dassow, J., Mitrana, V.: Stack cooperation in multistack pushdown automata. J. Comput. Syst. Sci. 58, 611\u2013621 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"9053_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(84)90023-9","volume":"32","author":"J. Duske","year":"1984","unstructured":"Duske, J., Parchmann, R.: Linear indexed languages. Theor. Comput. Sci. 32(1\u20132), 47\u201360 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"9053_CR9","unstructured":"Engelfriet, J.: Context-free grammars with storage. Report 86\u201311, Vakgroep Informatica, RijksUniversiteit Leiden (1986)"},{"key":"9053_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-94-009-1337-0_3","volume-title":"Natural Language Parsing and Linguistic Theories","author":"G. Gazdar","year":"1988","unstructured":"Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp.\u00a069\u201394. Reidel, Dordrecht (1988)"},{"key":"9053_CR11","volume-title":"Automata-theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Automata-theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)"},{"issue":"2","key":"9053_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01692513","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.H.: Control sets on grammars. Math. Syst. Theory 2(2), 159\u2013177 (1968)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"9053_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0022-0000(77)80026-3","volume":"15","author":"S.A. Greibach","year":"1977","unstructured":"Greibach, S.A.: Control sets on context-free grammar forms. J. Comput. Syst. Sci. 15(1), 35\u201398 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"9053_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing. Theoretical, Computational and Psychological Perspective","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing. Theoretical, Computational and Psychological Perspective, pp.\u00a0206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"9053_CR15","unstructured":"Khabbaz, N.A.: Generalized context free languages. Ph.D. thesis, University of Iowa (1972)"},{"issue":"2","key":"9053_CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/S0022-0000(74)80052-8","volume":"8","author":"N.A. Khabbaz","year":"1974","unstructured":"Khabbaz, N.A.: A geometric hierarchy of languages. J. Comput. Syst. Sci. 8(2), 142\u2013157 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9053_CR17","unstructured":"Michaelis, J., Wartena, C.: How linguistic constraints on movement conspire to yield languages analyzable with a restricted form of LIGs. In: Proceedings of the Conference on Formal Grammar (FG\u201997), pp. 158\u2013168, Aix en Provence, 1997"},{"key":"9053_CR18","series-title":"Studies in Constrained Based Lexicalism","first-page":"263","volume-title":"Constraints and Resources in Natural Language Syntax and Semantics","author":"J. Michaelis","year":"1999","unstructured":"Michaelis, J., Wartena, C.: LIGs with reduced derivation sets. In: Bouma, G., Kruijff, G.-J.M., Hinrichs, E., Oehrle, R.T. (eds.) Constraints and Resources in Natural Language Syntax and Semantics. Studies in Constrained Based Lexicalism, vol.\u00a0II, pp.\u00a0263\u2013279. CSLI, Stanford (1999)"},{"key":"9053_CR19","unstructured":"Rado, J.: Topic-focus vs. background: the role of structural information in discourse interpretation. Ph.D. thesis, University of Massachusetts, Amherst (1997)"},{"key":"9053_CR20","unstructured":"San Pietro, P.: Two-stack automata. Internal report 92\u2013073, Dipartimento di Elettronica e Informazione, Politecnico di Milano (1992)"},{"key":"9053_CR21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","volume":"1","author":"D. Scott","year":"1967","unstructured":"Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1, 187\u2013212 (1967)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9053_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01704910","volume":"19","author":"H. Vogler","year":"1986","unstructured":"Vogler, H.: Iterated linear control and iterated one-turn pushdowns. Math. Syst. Theory 19(2), 117\u2013133 (1986)","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"9053_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009924903938","volume":"2","author":"C. Wartena","year":"1999","unstructured":"Wartena, C.: On the concatenation of one-turn pushdowns. Grammars 2(3), 259\u2013269 (1999)","journal-title":"Grammars"},{"key":"9053_CR24","unstructured":"Wartena, C.: Storage structures and conditions on movement in natural languages. Ph.D. thesis, Universit\u00e4t Potsdam (1999)"},{"key":"9053_CR25","unstructured":"Wartena, C.: Extending linear indexed grammars. In: Proceedings of the TAG+5 Workshop, pp. 207\u2013214, Paris, 2000"},{"key":"9053_CR26","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-45738-0_16","volume-title":"Logical Aspects of Computational Linguistics","author":"C. Wartena","year":"2001","unstructured":"Wartena, C.: Grammars with composite storages. In: Moortgat, M. (ed.) Logical Aspects of Computational Linguistics, pp.\u00a0266\u2013285. Springer, Berlin\/Heidelberg (2001)"},{"issue":"4","key":"9053_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90124-X","volume":"104","author":"D.J. Weir","year":"1992","unstructured":"Weir, D.J.: A geometric hierarchy beyond context-free languages. Theor. Comput. Sci. 104(4), 235\u2013261 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9053_CR28","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1111\/j.1467-8640.1994.tb00007.x","volume":"10","author":"D.J. Weir","year":"1994","unstructured":"Weir, D.J.: Linear iterated pushdowns. Comput. Intell. 10(4), 422\u2013430 (1994)","journal-title":"Comput. Intell."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9053-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-007-9053-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9053-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9053-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T19:14:48Z","timestamp":1630437288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-007-9053-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9053"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9053-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,3]]},"assertion":[{"value":"3 October 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}