Minimization of unary symmetric difference NFAs

Authors:
Lynette Van Zijl;Graham Müller
Affiliations:
Department of Computer Science, University of Stellenbosch, P/Bag X1, Matieland, 7602, South Africa;Department of Computer Science, University of Stellenbosch, P/Bag X1, Matieland, 7602, South Africa
Venue:
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Year:
2004

Citing 3
Cited 1

Derivatives of Regular Expressions

Journal of the ACM (JACM)
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Random Number Generation with +-NFAs

CIAA '01 Revised Papers from the 6th International Conference on 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the minimization of unary symmetric difference nondeterministic finite automata. To this end, we develop a modification of the Berlekamp-Massey algorithm. We then prove that, given a unary symmetric difference nondeterministic finite automaton with one final state, this modified algorithm produces a minimal symmetric difference nondeterministic finite automaton which accepts the same language. We also discuss the application of the technique in the case where the nondeterministic finite automaton has more than one final state.