Affiliation:
1. Technical University of Poznan, Department of Electrical Engineering, Poznan, Poland
Abstract
This paper is a continuation of the studies of Fleck, Weeg, and others concerning the theory of automorphisms of ordinary automata and of the work of Gil pertaining to time varying automata. A certain restricted class of time-varying automata, namely the class of polyadic automata, is investigated in detail. The results of an investigation of relationships concerning the group of automorphisms, the polyadic group of defined polyadic automata and the structure of the polyadic automation and the ordinary automata associated and with the polyadic automaton is presented.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献