On the asymptotic enumeration of accessible automata
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
19/04/2012
19/04/2012
2010
|
| Resumo |
We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series. CNPq[311909/2009-4] |
| Identificador |
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v.12, n.3, p.75-79, 2010 1365-8050 http://producao.usp.br/handle/BDPI/16711 http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1517/3253 |
| Idioma(s) |
eng |
| Publicador |
DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE |
| Relação |
Discrete Mathematics and Theoretical Computer Science |
| Direitos |
openAccess Copyright DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE |
| Palavras-Chave | #asymptotic enumeration #finite automata #Lagrange series #generalized binomial series #Computer Science, Software Engineering #Mathematics, Applied #Mathematics |
| Tipo |
article original article publishedVersion |
