Blocking of group automata. II. Mutual interlocking
И. А. Головинский · Journal of Computer and Systems Sciences International · 2009
Groups of automata formed by mutually interlocking connections of permutation automata are considered. Groups of maximal mutually interlocking connections of any permutation automata are found. The notion of simulation of a finite automaton by a semigroup of transactions of another automaton is introduced. An algorithm for construction of the model of finite permutation automaton using mutually interlocking connections of permutation triggers is given.