A. C. Fleck
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.
- 1 RXBIN, M. O., AND SCOTT, D. Finite automata and their decision problems. IBM J. Rvs. Dev. 3 (Apr. 1959), 114-125.Google Scholar
- 2 GINSBURG, S. Some remarks on abstract machines. Trans. Amer. Math. Soc. 96 (1960), 4OO-444.Google Scholar
- 3 MOORS, E. F. Gedanken-experiments on sequential machines. In Automata Studies, pp. 129-153, Princeton (1956).Google Scholar
- 4 WEEG, G.P. Some group theoretic properties of strongly connected automata. Unpublished research at the Computer Laboratory, Michigan State University; May 1961.Google Scholar
- 5 WEEG, G.P. The structure of an automaton and its operation-preserving transformation group. J. ACM 9, 5(July 1962), 345-349. Google Scholar
- 6 ZASSENrIAvS, H. The Theory of Groups. Chelsea Publishing Co., New York, N. Y., 1949.Google Scholar
Index Terms
- Isomorphism Groups of Automata
Recommendations
On groups generated by bi-reversible automata
Extending the notion of bi-reversibility to automata over a changing alphabet.Absence of 2-state bi-reversible automata over a bounded changing alphabet which generate the non-abelian free group F2.Natural and applicable realization of F2 by a 2-state ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Comments