
Accession Number : AD0625235
Title : ON THE STRUCTURE AND AUTOMORPHISMS OF FINITE AUTOMATA.
Descriptive Note : Doctoral thesis,
Corporate Author : ILLINOIS UNIV URBANA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Bavel,Zamir
Report Date : 01 OCT 1965
Pagination or Media Count : 93
Abstract : 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 P(A), the set of automorphisms leaving all primaries invariant, are studied via extensions of automorphisms of one primary to another.
Descriptors : (*AUTOMATA, MAPPING(TRANSFORMATIONS)), (*MAPPING(TRANSFORMATIONS), GROUPS(MATHEMATICS)), COMPUTERS, SET THEORY, ALGEBRA
Subject Categories : Theoretical Mathematics
Computer Hardware
Distribution Statement : APPROVED FOR PUBLIC RELEASE