Blackhole Pushdown Automata

From International Center for Computational Logic

Toggle side column

Blackhole Pushdown Automata

Erzsébet Csuhaj-VarjúErzsébet Csuhaj-Varjú,  Tomáš MasopustTomáš Masopust,  György VaszilGyörgy Vaszil
Blackhole Pushdown Automata


Erzsébet Csuhaj-Varjú, Tomáš Masopust, György Vaszil
Blackhole Pushdown Automata
Fundamenta Informaticae, 112(2-3):137-156, 2011
  • KurzfassungAbstract
    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.
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@article{CMV2011,
  author  = {Erzs{\'{e}}bet Csuhaj-Varj{\'{u}} and Tom{\'{a}}{\v{s}} Masopust
             and Gy{\"{o}}rgy Vaszil},
  title   = {Blackhole Pushdown Automata},
  journal = {Fundamenta Informaticae},
  volume  = {112},
  number  = {2-3},
  year    = {2011},
  pages   = {137-156},
  doi     = {10.3233/FI-2011-584}
}