Exact Generation of Minimal Acyclic Deterministic Finite Automata

@article{Almeida2007ExactGO,
  title={Exact Generation of Minimal Acyclic Deterministic Finite Automata},
  author={Marco Almeida and Nelma Moreira and Rog{\'e}rio Reis},
  journal={Int. J. Found. Comput. Sci.},
  year={2007},
  volume={19},
  pages={751-765}
}
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give upper and lower bounds for MADFAs enumeration and some exact formulas for small values of n. 

References

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

Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics • 2006
View 7 Excerpts
Highly Influenced

Algorithms on words

M. Lothaire
Applied Combinatorics on Words, chapter 1. Cambridge University Press • 2005
View 4 Excerpts
Highly Influenced

Improved Bounds on the Number of Automata Accepting Finite Languages

Developments in Language Theory • 2002
View 5 Excerpts
Highly Influenced

A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata

Discrete Mathematics & Theoretical Computer Science • 2008
View 2 Excerpts

The Maximum State Complexity for Finite Languages

Journal of Automata, Languages and Combinatorics • 2004
View 2 Excerpts

Analysis of algorithms

Random Struct. Algorithms • 1997
View 1 Excerpt

Regular languages

S. Yu
G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1. Springer-Verlag • 1997

Similar Papers

Loading similar papers…