DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
ON THE STRUCTURE AND AUTOMORPHISMS OF FINITE AUTOMATA.
ILLINOIS UNIV URBANA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
A minimal automaton is defined and its advantages illustrated. The notions of a primary of an automaton and of the generators of the primary are formulated. The source of a subset of states is defined. Homomorphisms, endomorphisms, isomorphisms, and automorphisms on automata are discussed. The cycle is used to characterize and count all automorphisms of a minimal automaton. The nature, behavior, and number of the members of PA, the set of automorphisms leaving all primaries invariant, are studied via extensions of automorphisms of one primary to another.
APPROVED FOR PUBLIC RELEASE