Corpus ID: 119631641

Computational Holonomy Decomposition of Transformation Semigroups

@article{EgriNagy2015ComputationalHD,
  title={Computational Holonomy Decomposition of Transformation Semigroups},
  author={A. Egri-Nagy and Chrystopher L. Nehaniv},
  journal={arXiv: Group Theory},
  year={2015}
}
  • A. Egri-Nagy, Chrystopher L. Nehaniv
  • Published 2015
  • Mathematics
  • arXiv: Group Theory
  • We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty lies in the strict separation of several different ideas appearing in the holonomy method. The steps of the proof and the constructions are illustrated with computed examples. 

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES
    The Krohn-Rhodes Theorem and Local Divisors
    17
    On the Krohn-Rhodes Cascaded Decomposition Theorem
    • O. Maler
    • Computer Science, Mathematics
    • 2010
    8
    Algebraic automata theory
    148
    Cascade Product of Permutation Groups
    6
    The q-theory of Finite Semigroups
    241
    Finite-Automaton Aperiodicity is PSPACE-Complete
    90