ON THE AUTOMORPHISM GROUP OF PRODUCT AUTOMATON.

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 G(A) is isomorphic to H, G(B) isomorphic to K and G(A) x G(B) isomorphic to G(A 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)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1969
Accession Number
AD0691757

Entities

People

  • Bruce H. Barnes

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Automata
  • Permutations

Fields of Study

  • Mathematics

Readers

  • Clinical Trial Research.
  • Graph Algorithms and Convex Optimization.