Skip to Main content Skip to Navigation
Journal articles

On the asymptotic enumeration of accessible automata

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990449
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:37:23 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:19 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:20:21 PM

File

1517-5543-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990449, version 1

Collections

Citation

Elcio Lebensztayn. On the asymptotic enumeration of accessible automata. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.75-79. ⟨hal-00990449⟩

Share

Metrics

Record views

102

Files downloads

1046