On the asymptotic enumeration of accessible automata.
Saved in:
| Title: | On the asymptotic enumeration of accessible automata. |
|---|---|
| Authors: | Lebensztayn, Elcio1 |
| Source: | Discrete Mathematics & Theoretical Computer Science (DMTCS). Jun2010, Vol. 12 Issue 3, p75-79. 5p. 1 Diagram, 1 Chart. |
| Subjects: | Sequential machine theory, Machine theory, Binomial theorem, Lagrange problem, Calculus of variations |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
