Abstract : We show that a determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata. The proof involves a bijection from these automata to certain marked lattice paths and a sign-reversing involution to evaluate the determinant. We also give a formula for the number of acyclic automata with a given set of sources.
https://hal.inria.fr/hal-00972318
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : jeudi 3 avril 2014 - 16:10:23
Dernière modification le : mercredi 29 novembre 2017 - 10:26:24
Document(s) archivé(s) le : jeudi 3 juillet 2014 - 16:31:26
