New Interpretation and Generalization of the Kameda-Weiner Method
Hellis Tamm · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
We present a reinterpretation of the Kameda-Weiner method of finding a minimal nondeterministic finite automaton (NFA) of a language, in terms of atoms of the language. We introduce a method to generate NFAs from a set of languages, and show that the Kameda-Weiner method is a special case of it. Our method provides a unified view of the construction of several known NFAs, including the canonical residual finite state automaton and the atomaton of the language.