DECOMPOSITION THEOREMS FOR FINITE SEQUENTIAL MACHINES.

Abstract

In this work we present a different proof of results by K. B. Krohn and J. L. Rhodes ((1)), and give a new result on the same lines. These authors proved that every function computed by a finite state machines can be constructed by 'elementary operations' on a set of 'prime functions.' By extending the scope of elementary operations, we show that all functions computed by finite machines are built from a single function. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1968
Accession Number
AD0673092

Entities

People

  • M. Magidor

Organizations

  • Hebrew University of Jerusalem

Tags

DTIC Thesaurus Topics

  • Chemical Reactions
  • Decomposition

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Software Engineering