Supernondeterministic Finite Automata

Authors:
Lynette van Zijl
Affiliations:
-
Venue:
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Year:
2001

Citing 3
Cited 1

Alternation

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)

Generalized acceptance, succinctness and supernondeterministic finite automata

Theoretical Computer Science - Implementation and application automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a simple generalization of the transition tables of nondeterministic finite automata leads to a hierarchy of succinct nondeterministic descriptions for finite automata. We show that the hierarchy corresponds to deterministic finite automata on level 0 and nondeterministic finite automata on level 1 by default, and prove that the hierarchy corresponds to alternating (boolean) finite automata on level 2. We show that there exists an n-state level 3 finite automaton M such that its equivalent minimal deterministic finite automaton M驴 has more that 22n states.