One-Turn Regulated Pushdown Automata and Their Reduction

Authors:
Alexander Meduna;Dušan Kolář
Affiliations:
Brno University of Technology, Department of Computer Science and Engineering, Božetěchova 2, Brno 612 66, Czech Republic;Brno University of Technology, Department of Computer Science and Engineering, Božetěchova 2, Brno 612 66, Czech Republic
Venue:
Fundamenta Informaticae
Year:
2002

Citing 6
Cited 4

The family of one-counter languages is closed under quotient

Acta Informatica
Automata and languages: theory and applications

Automata and languages: theory and applications
Homomorphic characterizations of recursively enumerable languages with very small language classes

Theoretical Computer Science
Regulated pushdown automata

Acta Cybernetica
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory

Introduction to Formal Language Theory

Self-regulating finite automata

Acta Cybernetica
Regulated nondeterminism in pushdown automata

Theoretical Computer Science
Regulated nondeterminism in pushdown automata

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case

Fundamenta Informaticae - Non-Classical Models of Automata and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses some simple and natural restrictions of regulated pushdown automata, whose moves are regulated by some control languages. Most importantly, it studies one-turn regulated pushdown automata and proves that they characterize the family of recursively enumerable languages. In fact, this characterization holds even for atomic one-turn regulated pushdown automata of a reduced size. This result is established in terms of acceptance by final state and empty pushdown, acceptance by final state, and acceptance by empty pushdown.