SgpDec: Cascade (De)Compositions of Finite Transformation Semigroups and Permutation Groups
暂无分享,去创建一个
[1] Abraham Ginzburg,et al. Chapter 5 – Coverings of Automata , 1968 .
[2] Emden R. Gansner,et al. Graphviz and Dynagraph – Static and Dynamic Graph Drawing Tools , 2003 .
[3] Jonathan L. Alperin,et al. Groups and Representations , 1995 .
[4] Charles Wells,et al. A Krohn-Rhodes Theorem for categories , 1980 .
[5] Pál Dömösi,et al. ALGEBRAIC THEORY OF FINITE AUTOMATA NETWORKS , 1998 .
[6] Michael A. Arbib,et al. Algebraic theory of machines, languages and semigroups , 1969 .
[7] M. Dal Cin,et al. The Algebraic Theory of Automata , 1980 .
[8] Jean Michel,et al. Handbook of computational group theory , 2006, Math. Comput..
[9] J. Rhodes,et al. Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .
[10] Chrystopher L. Nehaniv,et al. Cascade Product of Permutation Groups , 2013, 1303.0091.
[11] H. P. Zeige,et al. Cascade Synthesis of Finite-State Machines , 2004 .
[12] W. Holcombe. Algebraic automata theory: Contents , 1982 .
[13] Chrystopher L. Nehaniv,et al. Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction , 2013, Biosyst..
[14] H. Paul Zeiger,et al. Cascade synthesis of finite-state machines , 1965, SWCT.
[15] Chrystopher L. Nehaniv,et al. Algebraic Theory of Automata Networks (SIAM Monographs on Discrete Mathematics and Applications, 11) , 2004 .