Abstract
Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Van Der Merwe, B., Tamm, H., & Van Zijl, L. (2012). Minimal DFA for symmetric difference NFA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 307–318). https://doi.org/10.1007/978-3-642-31623-4_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
