Paper Info
Title
Exact Generation Of Minimal Acyclic Deterministic Finite Automata
Abstract
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.
Year
DOI
Venue
2007
10.1142/S0129054108005930
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Keywords
DocType
Volume
acyclic deterministic finite automata, minimal automata, finite languages, generation, enumeration
Conference
19
Issue
ISSN
Citations 
4
0129-0541
3
PageRank 
References 
Authors
0.45
5
3
Name
Order
Citations
PageRank
Marco Almeida1313.99
Nelma Moreira218033.98
Rogério Reis314025.74