Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computer and Systems Sciences International
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
