%0 Journal Article
%T A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata
%A David Callan
%J Discrete Mathematics & Theoretical Computer Science
%D 2008
%I Discrete Mathematics & Theoretical Computer Science
%X 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.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/657