Minimal DFA for symmetric difference NFA

Authors:
Brink van der Merwe;Hellis Tamm;Lynette van Zijl
Affiliations:
Department of Computer Science, Stellenbosch University, Matieland, South Africa;Institute of Cybernetics, Tallinn University of Technology, Tallinn, Estonia;Department of Computer Science, Stellenbosch University, Matieland, South Africa
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 11
Cited 0

Minimal NFA problems are hard

SIAM Journal on Computing
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Residual Finite State Automata

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Finite-state transducers in language and speech processing

Computational Linguistics
On binary ⊕-NFAs and succinct descriptions of regular languages

Theoretical Computer Science - Implementation and application of automata
Compact Normal Form for Regular Languages as Xor Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Handbook of Weighted Automata

Handbook of Weighted Automata
Theory of átomata

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Ambiguity of unary symmetric difference NFAs

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Weighted automata and weighted logics on infinite words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Quotient complexities of atoms of regular languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

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.