New Interpretation and Generalization of the Kameda-Weiner Method.

DOI10.4230/LIPIcs.ICALP.2016.116zbMath1388.68182OpenAlexW2560062734MaRDI QIDQ4598258

Hellis Tamm

Publication date: 19 December 2017

Full work available at URL: http://doi.org/10.4230/LIPIcs.ICALP.2016.116

zbMATH Keywords

nondeterministic finite automataatoms of regular languagesNFA minimizationKameda-Weiner method

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Quotients and atoms of reversible languages, Duality of Lattices Associated to Left and Right Quotients, Nondeterministic syntactic complexity, Forward Bisimulations for Nondeterministic Symbolic Finite Automata, Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited, Yet another canonical nondeterministic automaton