Minimizing nfa's and regular expressions

Authors:
Gregor Gramlich;Georg Schnitger
Affiliations:
Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt, Robert-Mayer-Straße 11-15, 60054 Frankfurt am Main, Germany;Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt, Robert-Mayer-Straße 11-15, 60054 Frankfurt am Main, Germany
Venue:
Journal of Computer and System Sciences
Year:
2007

Citing 11
Cited 14

Prediction-preserving reducibility

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The minimum consistent DFA problem cannot be approximated within any polynomial

Journal of the ACM (JACM)
Minimal NFA problems are hard

SIAM Journal on Computing
Cryptographic limitations on learning Boolean formulae and finite automata

Journal of the ACM (JACM)
Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
On the number of distinct languages accepted by finite automata with n states

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Follow automata

Information and Computation
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science - Developments in language theory
Minimizing NFA's and regular expressions

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

The Tractability Frontier for NFA Minimization

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds for the transition complexity of NFAs

Journal of Computer and System Sciences
Learning unary automata

Journal of Automata, Languages and Combinatorics
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

Theoretical Computer Science
A Backward and a Forward Simulation for Weighted Tree Automata

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Backward and forward bisimulation minimization of tree automata

Theoretical Computer Science
Minimizing weighted tree grammars using simulation

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Büchi automata can have smaller quotients

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The tractability frontier for NFA minimization

Journal of Computer and System Sciences
GPP-Grep: high-speed regular expression processing engine on general purpose processors

RAID'12 Proceedings of the 15th international conference on Research in Attacks, Intrusions, and Defenses
Descriptional complexity of determinization and complementation for finite automata

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Descriptional complexity of determinization and complementation for finite automata

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Hyper-optimization for deterministic tree automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's). We show that it is impossible to efficiently minimize a given nfa or regular expression with n states, transitions, respectively symbols within the factor o(n), unless P=PSPACE. For the unary case, we show that for any @d0 it is impossible to efficiently construct an approximately minimal nfa or regular expression within the factor n^1^-^@d, unless P=NP. Our inapproximability results for a given dfa with n states are based on cryptographic assumptions and we show that any efficient algorithm will have an approximation factor of at least npoly(logn). Our setup also allows us to analyze the minimum consistent dfa problem.