An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets
As its name suggests, a stateless pushdown automaton has no states. As a result, each of its computational steps depends only on the currently scanned symbol and the current pushdown-store top. In this paper, we consider stateless pushdown automata whose size of their pushdown alphabet is limited by a positive integer. More specifically, we establish an infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets. In addition, we prove analogous results for stateless deterministic pushdown automata and stateless real-time pushdown automata. A formulation of an open problem closes the paper.
Keywordsstateless pushdown automata limited pushdown alphabets generative power infinite hierarchy of language families
Unable to display preview. Download preview PDF.
- 10.Meduna, A.: Elements of Compiler Design. Auerbach Publications, Boston (2007)Google Scholar
- 12.Valiant, L.G.: Decision procedures for families of deterministic pushdown automata. Research Report CS-RR-001, Department of Computer Science, University of Warwick, Coventry, UK (1973)Google Scholar
- 13.Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. International Journal of Foundations of Computer Science, 1259–1276 (2008)Google Scholar