Blackhole pushdown automata

E. Csuhaj-Varjú, Tomáš Masopust, György Vaszil

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)137-156
Number of pages20
JournalFundamenta Informaticae
Volume112
Issue number2-3
DOIs
Publication statusPublished - 2011

Fingerprint

Pushdown Automata
Black Holes
Automata
Strings
Language

Keywords

  • computational power
  • Pushdown automaton
  • regulation

ASJC Scopus subject areas

  • Information Systems
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Algebra and Number Theory

Cite this

Blackhole pushdown automata. / Csuhaj-Varjú, E.; Masopust, Tomáš; Vaszil, György.

In: Fundamenta Informaticae, Vol. 112, No. 2-3, 2011, p. 137-156.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E, Masopust, T & Vaszil, G 2011, 'Blackhole pushdown automata', Fundamenta Informaticae, vol. 112, no. 2-3, pp. 137-156. https://doi.org/10.3233/FI-2011-584
Csuhaj-Varjú, E. ; Masopust, Tomáš ; Vaszil, György. / Blackhole pushdown automata. In: Fundamenta Informaticae. 2011 ; Vol. 112, No. 2-3. pp. 137-156.
@article{f01c499698c74c21bd84f789d3897079,
title = "Blackhole pushdown automata",
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.",
keywords = "computational power, Pushdown automaton, regulation",
author = "E. Csuhaj-Varj{\'u} and Tom{\'a}š Masopust and Gy{\"o}rgy Vaszil",
year = "2011",
doi = "10.3233/FI-2011-584",
language = "English",
volume = "112",
pages = "137--156",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "2-3",

}

TY - JOUR

T1 - Blackhole pushdown automata

AU - Csuhaj-Varjú, E.

AU - Masopust, Tomáš

AU - Vaszil, György

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - computational power

KW - Pushdown automaton

KW - regulation

UR - http://www.scopus.com/inward/record.url?scp=84858047180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858047180&partnerID=8YFLogxK

U2 - 10.3233/FI-2011-584

DO - 10.3233/FI-2011-584

M3 - Article

AN - SCOPUS:84858047180

VL - 112

SP - 137

EP - 156

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 2-3

ER -