DECOMPOSITIONS OF FINITE AUTOMATA

Abstract

The basic ideas of an algebraic decomposition theory of finite automata are presented. These ideas are generalized by also considering admissible decompositions (overlapping partitions) of finite automata. Further research is required in order to derive from the basic theory, presented in this report, efficient techniques for the synthesis of sequential machine networks. On the other hand, the extension of some of the results obtained in this report to abstract algebras in general might be of some interest.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1963
Accession Number
AD0405816

Entities

People

  • Michael Yoeli

Organizations

  • Technion – Israel Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algebra
  • Automata
  • Blood Coagulation Factors
  • Computers
  • Coverings
  • Decomposition
  • Engineering
  • Finite Alphabet
  • Government Procurement
  • Governments
  • Information Systems
  • Machines
  • Military Research
  • Notation
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.