Elcio Lebensztayn - On the asymptotic enumeration of accessible automata

dmtcs:512 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 3 - https://doi.org/10.46298/dmtcs.512
On the asymptotic enumeration of accessible automataArticle

Authors: Elcio Lebensztayn ORCID1

  • 1 Institute of Mathematics and Statistics [Sao Paulo]

Automata, Logic and Semantics

[en]
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.

https://doi.org/10.46298/dmtcs.512
Source: HAL:hal-00990449v1
Volume: Vol. 12 no. 3
Section: Automata, Logic and Semantics
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] asymptotic enumeration, finite automata, Lagrange series, generalized binomial series

2 Documents citing this article

Share and export

Consultation statistics

This page has been seen 632 times.
This article's PDF has been downloaded 596 times.