A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata [article]

Tomáš Masopust
2012 arXiv   pre-print
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend
more » ... se results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence of such a hierarchy for m-state deterministic pushdown automata is left open.
arXiv:1208.5002v1 fatcat:o5prfv5nzreero3y4n3cwtg7du