Blackhole pushdown automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F11%3A00374110" target="_blank" >RIV/67985840:_____/11:00374110 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/FI-2011-584" target="_blank" >http://dx.doi.org/10.3233/FI-2011-584</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FI-2011-584" target="_blank" >10.3233/FI-2011-584</a>

Result language
angličtina
Original language name
Blackhole pushdown automata
Original language description
We introduce and investigate blackhole pushdown automata, variants of pushdown automata, where a string can always be pushed to the pushdown, but only a given depth of the pushdown content is remembered (the rest of the pushdown content is either canceled or becomes inaccessible). We also study blackhole variants of regulated pushdown automata, where the automaton in some distinguished states checks the form of its pushdown content against a given control language. We present characterizations of several language families in terms of these constructs.
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
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)