Abstract
Various automata using certain kinds of tuples of storages are defined in the literature. In this paper we investigate some possibilities to define such storages independently of automata by a restricted type of product on storages, called concatenation. It is shown that there is a strong relation between automata with concatenated pushdowns and restricted classes of linear controlled grammars. Using this result, some relations between hierarchies of automata with an ascending number of concatenated pushdowns and some well-known hierarchies of controlled grammars follow naturally.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Breveglieri, L., Cherubini, A., Citrini, C., Crespi Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci. 7(3), 253–291 (1996)
Budach, L.: Environments, labyrinths and automata. In: Karpiński, M. (ed.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 56, pp. 54–64. Springer, Berlin (1977)
Budach, L.: Personal communication (1999)
Cherubini, A., San Pietro, P.: On the relation between multi-depth grammars and tree-adjoining grammars. Publ. Math. Debrecen 54(Supplement), 625–640 (1999)
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)
Cherubini, A., San Pietro, P.: Tree adjoining languages and multipushdown languages. Theory Comput. Syst. 33(4), 257–293 (2000)
Dassow, J., Mitrana, V.: Stack cooperation in multistack pushdown automata. J. Comput. Syst. Sci. 58, 611–621 (1999)
Duske, J., Parchmann, R.: Linear indexed languages. Theor. Comput. Sci. 32(1–2), 47–60 (1984)
Engelfriet, J.: Context-free grammars with storage. Report 86–11, Vakgroep Informatica, RijksUniversiteit Leiden (1986)
Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp. 69–94. Reidel, Dordrecht (1988)
Ginsburg, S.: Automata-theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)
Ginsburg, S., Spanier, E.H.: Control sets on grammars. Math. Syst. Theory 2(2), 159–177 (1968)
Greibach, S.A.: Control sets on context-free grammar forms. J. Comput. Syst. Sci. 15(1), 35–98 (1977)
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. 206–250. Cambridge University Press, Cambridge (1985)
Khabbaz, N.A.: Generalized context free languages. Ph.D. thesis, University of Iowa (1972)
Khabbaz, N.A.: A geometric hierarchy of languages. J. Comput. Syst. Sci. 8(2), 142–157 (1974)
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’97), pp. 158–168, Aix en Provence, 1997
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. II, pp. 263–279. CSLI, Stanford (1999)
Rado, J.: Topic-focus vs. background: the role of structural information in discourse interpretation. Ph.D. thesis, University of Massachusetts, Amherst (1997)
San Pietro, P.: Two-stack automata. Internal report 92–073, Dipartimento di Elettronica e Informazione, Politecnico di Milano (1992)
Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1, 187–212 (1967)
Vogler, H.: Iterated linear control and iterated one-turn pushdowns. Math. Syst. Theory 19(2), 117–133 (1986)
Wartena, C.: On the concatenation of one-turn pushdowns. Grammars 2(3), 259–269 (1999)
Wartena, C.: Storage structures and conditions on movement in natural languages. Ph.D. thesis, Universität Potsdam (1999)
Wartena, C.: Extending linear indexed grammars. In: Proceedings of the TAG+5 Workshop, pp. 207–214, Paris, 2000
Wartena, C.: Grammars with composite storages. In: Moortgat, M. (ed.) Logical Aspects of Computational Linguistics, pp. 266–285. Springer, Berlin/Heidelberg (2001)
Weir, D.J.: A geometric hierarchy beyond context-free languages. Theor. Comput. Sci. 104(4), 235–261 (1992)
Weir, D.J.: Linear iterated pushdowns. Comput. Intell. 10(4), 422–430 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Wartena, C. Storage Products and Linear Control of Derivations. Theory Comput Syst 42, 157–186 (2008). https://doi.org/10.1007/s00224-007-9053-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-007-9053-2