Affiliation:
1. Department of Mathematics, Southern Illinois University, Carbondale, Illinois
Abstract
Arbitrary finite automata are decomposed into their major substructures, the primaries. Several characterizations of homomorphisms, endomorphisms, isomorphisms, and automorphisms of arbitrary finite automata are presented via reduction to the primaries of the automata. Various characterizations of these transition-preserving functions on singly generated automata are presented and are used as a basis for the reduction. Estimates on the number of functions of each type are given.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference12 articles.
1. ARBIB M.A. Automaton automorphisms. Inform. Contr.; to appear. ARBIB M.A. Automaton automorphisms. Inform. Contr.; to appear.
2. Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献