Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Authors:
Benjamín René Bedregal
Affiliations:
Federal University of Rio Grande do Norte, Department of Informatics and Applied Mathematics, Laboratory of Logic and Computational Intelligence, Brazil. E-mail: bedregal@dimap.ufrn.br
Venue:
Fundamenta Informaticae
Year:
2007

Citing 7
Cited 0

A pumping lemma for deterministic context-free languages

Information Processing Letters
Measures of nondeterminism for pushdown automata

Journal of Computer and System Sciences
A New Approach to Formal Language Theory by Kolmogorov Complexity

SIAM Journal on Computing
Pushdown automata with bounded nondeterminism and bounded ambiguity

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Measuring nondeterminism in pushdown automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

By explicit nondeterminism degree of a pushdown automata we mean the maximal number of choices in the transitions of the automata. In this paper we will prove that each pushdown automaton has an equivalent pushdown automaton with degree 1 of explicit nondeterminism, which implies that λ-moves in pda are sufficient to simulate nondeterminism. Moreover, from this normal form (i.e. pda with degree 1 of explicit nondeterminism) we can measure the amount of (implicit) nondeterminism. This measure will be used to determine a countable infinite hierarchy of contextfree language subclasses, whose bottom is the class of deterministic context-free languages and the top is the class of context-free languages.