Minimal DFA for Symmetric Difference NFA

  • Brink van der Merwe
  • Hellis Tamm
  • Lynette van Zijl
Conference paper

DOI: 10.1007/978-3-642-31623-4_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7386)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Brink van der Merwe
    • 1
  • Hellis Tamm
    • 2
  • Lynette van Zijl
    • 1
  1. 1.Department of Computer ScienceStellenbosch UniversityMatielandSouth Africa
  2. 2.Institute of CyberneticsTallinn University of TechnologyTallinnEstonia

Personalised recommendations