A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
