A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2008

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.
Fichier principal
Vignette du fichier
657-3327-2-PB.pdf (103.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00972318 , version 1 (03-04-2014)

Identifiers

Cite

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

Collections

TDS-MACS
64 View
878 Download

Altmetric

Share

Gmail Facebook X LinkedIn More