Generalized acceptance, succinctness and supernondeterministic finite automata
TLDR
It is shown that there exists an 2-state level 3 finite automaton with generalized acccptance, such that its equivalent minimal deterministic finite automata has more that 222 states.About:
This article is published in Theoretical Computer Science.The article was published on 2004-02-16 and is currently open access. It has received 1 citations till now. The article focuses on the topics: Deterministic finite automaton & Nondeterministic finite automaton.read more
Citations
More filters
Book ChapterDOI
Language Equations with Symmetric Difference
TL;DR: The paper investigates the expressive power of language equations with the operations of concatenation and symmetric difference by demonstrating that the sets representable by unique solutions of such equations are exactly the recursively enumerable sets (their complements, respectively).
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
On equations for regular languages, finite automata, and sequential networks☆
TL;DR: It is shown that any system of equations of the form X i = ⋃ α∈A α·F i,a ∪δ i i=1,…,n has a unique solution which, moreover, is regular.
Journal ArticleDOI
Succinct representation of regular languages by boolean automata II
TL;DR: A precisely attainable lower bound on the succinctness of representing regular languages by boolean automata is shown; namely, it is shown that, for every n ⩾ 1, there exists a reduced automaton D n with n states such that the smallest boolean automaton accepting the same language has also n states.
Dissertation
Generalized nondeterminism and the succinct representation of regular languages
TL;DR: It is concluded that the traditional nondeterministic nite automaton does not lend itself in particular to the succinct representation of regular languages.