On the asymptotic enumeration of accessible automata
2010 ◽
Vol Vol. 12 no. 3
(Automata, Logic and Semantics)
◽
Keyword(s):
Automata, Logic and Semantics International audience 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.
2014 ◽
Vol Vol. 16 no. 1
(Combinatorics)
◽
Keyword(s):
2020 ◽
Vol DMTCS Proceedings, 28th...
◽
2013 ◽
Vol Vol. 15 no. 1
(Automata, Logic and Semantics)
◽
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
2010 ◽
Vol Vol. 12 no. 3
◽
Keyword(s):
2009 ◽
Vol DMTCS Proceedings vol. AK,...
(Proceedings)
◽
Keyword(s):
2009 ◽
Vol Vol. 11 no. 1
(Combinatorics)
◽
2008 ◽
Vol DMTCS Proceedings vol. AI,...
(Proceedings)
◽
2013 ◽
Vol 32
(4)
◽
pp. 393-408
◽
Keyword(s):
2009 ◽
Vol Vol. 11 no. 1
(Combinatorics)
◽