Minimal DFA for Symmetric Difference NFA
- Cite this paper as:
- van der Merwe B., Tamm H., van Zijl L. (2012) Minimal DFA for Symmetric Difference NFA. In: Kutrib M., Moreira N., Reis R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg
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 . 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.
Unable to display preview. Download preview PDF.