Compact Normal Form for Regular Languages as Xor Automata

@inproceedings{Vuillemin2009CompactNF,
  title={Compact Normal Form for Regular Languages as Xor Automata},
  author={Jean Vuillemin and Nicolas Gama},
  booktitle={CIAA},
  year={2009}
}
The only presently known normal form for a regular language L ∈ Reg is its Minimal Deterministic Automaton MDA(L). We show that a regular language is also characterized by a finite dimension dim(L), which is always smaller than the number |MDA(L)| of states, and often exponentially so. The dimension is also the minimal number of states of all Nondeterministic Xor Automaton (NXA) which accept the language. NXAs combine the advantages of deterministic automata (normal form, negation, minimization… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Matrices de hankel

  • M. Fliess
  • J. Math pures et appl.,
  • 1974
Highly Influential
4 Excerpts

Combining two algorithms by brzozowski

  • B. W. Watson
  • Proceedings of the Fifth International Conference…
  • 2001
1 Excerpt

A taxonomy of finite automata minimization algorithmes

  • B. W. Watson
  • Computing Science Note 93/44,
  • 1993
2 Excerpts

Similar Papers

Loading similar papers…