A note on limited pushdown alphabets in stateless deterministic pushdown automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00394000" target="_blank" >RIV/67985840:_____/13:00394000 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0129054113500068" target="_blank" >http://dx.doi.org/10.1142/S0129054113500068</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054113500068" target="_blank" >10.1142/S0129054113500068</a>

Result language
angličtina
Original language name
A note on limited pushdown alphabets in stateless deterministic pushdown automata
Original language description
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 these 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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GPP202%2F11%2FP028" target="_blank" >GPP202/11/P028: Decentralized and coordination supervisory control</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)