| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
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.
Cited literature [3 references]
https://hal.inria.fr/hal-00972318
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:10:23 PM
Last modification on : Thursday, April 4, 2019 - 11:30:04 AM
Long-term archiving on: : Thursday, July 3, 2014 - 4:31:26 PM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:10:23 PM
Last modification on : Thursday, April 4, 2019 - 11:30:04 AM
Long-term archiving on: : Thursday, July 3, 2014 - 4:31:26 PM
File
657-3327-2-PB.pdf
Files produced by the author(s)