Corpus ID: 10804426

A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata

@article{Callan2008ADO,
  title={A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata},
  author={David Callan},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={2008},
  volume={10}
}
  • David Callan
  • Published in
    Discret. Math. Theor. Comput…
    2008
  • Computer Science, Mathematics
  • 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. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    Exact Generation of Acyclic Deterministic Finite Automata

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Exact Generation of Minimal Acyclic Deterministic Finite Automata

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.

    Exact enumeration of acyclic deterministic automata

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL