Generalized acceptance, succinctness and supernondeterministic finite automata

Authors:
Lynette van Zijl
Affiliations:
Department of Computer Science, Stellenbosch University, Stellenbosch, South Africa
Venue:
Theoretical Computer Science - Implementation and application automata
Year:
2004

Citing 3
Cited 0

Alternation

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

Introduction To Automata Theory, Languages, And Computation
Supernondeterministic Finite Automata

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define generalized, acceptance in nondeterministic finite automata, in order to achieve more instances of succinct descriptions of regular languages in practical applications. We show that generalized acceptance enable the construction of a hierarchy of succinct nondeterministic descriptions for finite automata. The hierarchy corresponds to deterministic finite automata on level 0 and nondeterministic finite automata on level 1 by default, and we prove that the hierarchy corresponds to alternating (boolean) finite automata on level 2. We show that there exists an 2-state level 3 finite automaton with generalized acccptance, such that its equivalent minimal deterministic finite automaton has more that 222 states.