Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited

DOI10.1007/978-3-319-53733-7_19zbMath1485.68147OpenAlexW2588385057MaRDI QIDQ5739002

Brink van der Merwe, Hellis Tamm

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Quotients and atoms of reversible languages ⋮ Yet another canonical nondeterministic automaton

Cites Work

• Unnamed Item
• Unnamed Item
• On the state complexity of reversals of regular languages
• A lower bound technique for the size of nondeterministic finite automata
• Intersection and union of regular languages and state complexity
• Theory of átomata
• Quotient Complexities of Atoms in Regular Ideal Languages
• Linear Automaton Transformations
• Some Minimality Results on Biresidual and Biseparable Automata
• Finding Lower Bounds for Nondeterministic State Complexity Is Hard
• Minimal NFA and biRFSA Languages
• THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
• New Interpretation and Generalization of the Kameda-Weiner Method.
• Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
• On the State Minimization of Nondeterministic Finite Automata
• Complexity of atoms, combinatorially

This page was built for publication: Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited