On the asymptotic enumeration of accessible automata
Copyright policy )On the asymptotic enumeration of accessible automata
Automata, Logic and Semantics 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.
- Universidade de São Paulo Brazil
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], asymptotic enumeration, QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], finite automata, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Lagrange series, generalized binomial series, Mathematics, lagrange series
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], asymptotic enumeration, QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], finite automata, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Lagrange series, generalized binomial series, Mathematics, lagrange series
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!