DECOMPOSITIONS OF AUTOMATA USING NORMAL SUBMONOIDS.

Abstract

The series-parallel decomposition of automata is considered. The approach is both a simplification and generalization of certain of the constructions employed in the Krohn-Rhodes theory of decomposition. In particular the notion of decomposition by subnormal series to monoids is generalized and it is shown how to decompose group machines more efficiently than can be done using the Wreath product. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1967
Accession Number
AD0664143

Entities

People

  • Bernard Zeigler

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Automata
  • Construction
  • Decomposition
  • Machines

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.