Determination of finite automata accepting subregular languages

Authors:
Henning Bordihn;Markus Holzer;Martin Kutrib
Affiliations:
Institut für Informatik, Universität Potsdam, August-Bebel-Straβe 89, 14482 Potsdam, Germany;Institut für Informatik, Universität Giessen, Arndtstraβe 2, 35392 Giessen, Germany;Institut für Informatik, Universität Giessen, Arndtstraβe 2, 35392 Giessen, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 12
Cited 11

Finite automata and unary languages

Theoretical Computer Science
NFA to DFA transformation for finite languages over arbitrary alphabets

Journal of Automata, Languages and Combinatorics
Ultimate-Definite and Symmetric-Definite Events and Automata

Journal of the ACM (JACM)
Roots of Star Events

Journal of the ACM (JACM)
On Decompositions of Regular Events

Journal of the ACM (JACM)
Errata to: "finite automata and unary languages"

Theoretical Computer Science
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Characterizations of locally testable events

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems

IBM Journal of Research and Development
Multiple-entry finite automata

Journal of Computer and System Sciences
Locally testable languages

Journal of Computer and System Sciences

Complexity in union-free regular languages

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Networks of evolutionary processors with subregular filters

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Nondeterministic state complexity of star-free languages

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Quotient complexity of ideal languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Basic operations on binary suffix-free languages

MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
State complexity of combined operations with two basic operations

Theoretical Computer Science
On external contextual grammars with subregular selection languages

Theoretical Computer Science
On a structural property in the state complexity of projected regular languages

Theoretical Computer Science
Nondeterministic state complexity of star-free languages

Theoretical Computer Science
On union-free and deterministic union-free languages

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Quotient complexity of ideal languages

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate the descriptional complexity of the nondeterministic finite automaton (NFA) to the deterministic finite automaton (DFA) conversion problem, for automata accepting subregular languages such as combinational languages, definite languages and variants thereof, (strictly) locally testable languages, star-free languages, ordered languages, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages. Most of the bounds for the conversion problem are shown to be tight in the exact number of states, that is, the number is sufficient and necessary in the worst case. Otherwise tight bounds in order of magnitude are shown.