Efficient Equivalence and Minimization for Non Deterministic Xor Automata - GREYC amacc Access content directly
Reports (Research Report) Year : 2010

Efficient Equivalence and Minimization for Non Deterministic Xor Automata

Abstract

A word w in a regular language L is or-accepted by a non-deterministic finite or-automaton A if there exists a path along w from some initial state to some final state in A. The same word w is xor-accepted by the same non-deterministic finite xor-automaton A if the number of accepting pathes is odd. In the deterministic case, accepting pathes are unique and both definitions coincide. No polynomial time algorithm is known to minimize NFAs or to compute their equivalence. By contrast, we present a cubic time algorithm to reduce a xor-automaton to a minimal form M = MXA(A), within the least possible number of states. It is a finite strong normal form and automata equivalence is efficiently decided through reduction to the SNF.
Fichier principal
Vignette du fichier
MXA.pdf (630.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00487031 , version 1 (27-05-2010)

Identifiers

  • HAL Id : inria-00487031 , version 1

Cite

Jean Vuillemin, Nicolas Gama. Efficient Equivalence and Minimization for Non Deterministic Xor Automata. [Research Report] Ecole Normale Supérieure. 2010, pp.25. ⟨inria-00487031⟩
276 View
492 Download

Share

Gmail Facebook X LinkedIn More