Skip to Main content Skip to Navigation
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972318
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
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)

Identifiers

  • HAL Id : hal-00972318, version 1

Collections

Citation

David Callan. A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (2), pp.77--86. ⟨hal-00972318⟩

Share

Metrics

Record views

268

Files downloads

955