Affiliation:
1. Michigan State University, East Lansing, Michigan
Abstract
This paper persues a discussion of certain algebraic properties of automata and their relationship to the structure (i.e., properties of the next state function) of automata. The device which is used for this study is the association of a group with each automaton. We introduce functions on automata and study the group of an automaton, a representation for the group elements and the direct product of automata. Finally, for a certain class of automata a necessary and sufficient condition, in terms of the group of the automaton, is given for insuring that an automaton can be represented as a direct product.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference6 articles.
1. Finite automata and their decision problems;RXBIN M. O.;IBM J. Rvs. Dev.,1959
2. Some remarks on abstract machines;GINSBURG S;Trans. Amer. Math. Soc.,1960
3. WEEG G.P. Some group theoretic properties of strongly connected automata. Unpublished research at the Computer Laboratory Michigan State University; May 1961. WEEG G.P. Some group theoretic properties of strongly connected automata. Unpublished research at the Computer Laboratory Michigan State University; May 1961.
4. The Structure of an Automaton and Its Operation-Preserving Transformation Group
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献