On the asymptotic enumeration of accessible automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

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.
Fichier principal
Vignette du fichier
1517-5543-1-PB.pdf (217.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990449 , version 1 (13-05-2014)

Identifiers

Cite

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

Collections

TDS-MACS
22 View
894 Download

Altmetric

Share

Gmail Facebook X LinkedIn More