Blackhole Pushdown Automata

  • Authors:

  • Erzsébet Csuhaj-Varjú;Tomáš Masopust;György Vaszil

  • Affiliations:

  • (Correspd.) (Also affiliated with the Dept. of Algorithms and Their Apps., Fac. of Informatics, Eötvös Loránd Univ., Pázmány Péter sétány 1/c, 1117 Budapest ...;(Res. supported by the GAČR grant no. P202/11/P028, and by the CAS, Inst. Res. Plan no. AV0Z10190503) Inst. of Math., Czech Acad. of Sci., Žižkova 22, 61662 Brno, Czech Republic. ma ...;Computer and Automation Research Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u. 13-17, Hungary. vaszil@sztaki.hu

  • Venue:
  • Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.