Accession Number:

AD0691757

Title:

ON THE AUTOMORPHISM GROUP OF PRODUCT AUTOMATON.

Descriptive Note:

Technical rept.,

Corporate Author:

IOWA UNIV IOWA CITY DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1969-08-01

Pagination or Media Count:

14.0

Abstract:

In a recent article, Weeg asked the following question Given two arbitrary finite groups H and K of regular permutations of finite sets is it possible to find two strongly related finite automata A and B such that the groups of automorphisms GA is isomorphic to H, GB isomorphic to K and GA x GB isomorphic to GA x B. Pickertt has given a constructive answer to this question. His solution, however, uses an excessive number of inputs. In this paper another constructive approach is given to this problem. This new approach uses considerably smaller number of inputs. Author

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE