David Callan - A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata

dmtcs:421 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, Vol. 10 no. 2 - https://doi.org/10.46298/dmtcs.421
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata

Authors: David Callan

    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.


    Volume: Vol. 10 no. 2
    Section: Combinatorics
    Published on: January 1, 2008
    Imported on: March 26, 2015
    Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    Share

    Consultation statistics

    This page has been seen 183 times.
    This article's PDF has been downloaded 311 times.