Abstract
Abstract storage types can be concatenated in two ways. It is shown that the languages accepted by automata using concatenations of one–turn pushdowns can be characterized in terms of linear grammars with controlled derivations. These representations show that for one–turn pushdowns both ways of concatenating are equivalent. Furthermore, a relation to the hierarchy of Khabbaz is shown.
Similar content being viewed by others
References
Breveglieri, L., A. Cherubini, C. Citrini, and S. Crespi Reghizzi. 'Multi-push-down languages and grammars. International Journal of Foundations of Computer Science 7(3): 253–291, 1996.
Duske, J. and R. Parchmann. Linear indexed languages. Theoretical Computer Sciences 32(1-2): 47–60, 1984.
Ginsburg, S. and E. H. Spanier. Finite-turn pushdown automata. SIAM Control 4(3): 429–453. 1966.
Ginsburg, S. and E. H. Spanier. Control sets on grammars. Mathematical Systems Theory 2(2): 159–177, 1968.
Greibach, S. A. Control sets on context-free grammar forms. Journal of Computer and System Sciences 15(1): 35–98, 1977.
Greibach, S. A. One way finite visit automata. Theoretical Computer Science 6: 175–221, 1978.
Khabbaz, N. A. Generalized context free languages. Ph.D. thesis, University of Iowa, 1972.
Khabbaz, N. A. A geometric hierarchy of languages. Journal of Computer and System Sciences 8(2): 142–157, 1974.
Rado, J. Topic-focus vs. background. The role of structural information in discourse interpretation. Ph.D. thesis, University of Massachusetts, Amherst, MA, 1997.
San Pietro, P. Two-stack automata. Internal Report 92-073, Dipartimento di Elettronica e Informazione, Politecnico di Milano, 1992.
Vogler, H. Iterated linear control and iterated one-turn pushdowns. Mathematical Systems Theory 19(2): 117–133, 1986.
Wartena, C. Grammars with composite storages. In Proceedings of the Conference on Logical Aspects of Computational Linguistics (LACL '98). Grenoble, pp. 11–141998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wartena, C. On the Concatenation of One–Turn Pushdowns. Grammars 2, 259–269 (1999). https://doi.org/10.1023/A:1009924903938
Issue Date:
DOI: https://doi.org/10.1023/A:1009924903938