Skip to main content
SpringerLink
Log in

Decomposition theorems for finite sequential machines

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

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 machine can be constructed by “elementary operations” on a set of “prime functions.” By extending the scope of elementary operations, we now show that all functions computed by finite machines are built from a single function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. B. Krohn and J. L. Rhodes:Algebraic theory of machines. Prime decomposition theorem for semigroups and machines, Trans. Amer. Math. Soc.,116 (1965), 450–464.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. B. Krohn and J. L. Rhodes:Complexity of finite semigroups and finite state machines, to appear in Proc. of the Conference on Algebraic Theory of Machines, Languages and Semigroups.

  3. K. B. Krohn, R. Mateosian and J. L. Rhodes:Ideals in finite semigroup and finite state machines, Mathematical System Theory1 (1967), 59–66.

    Article  MATH  MathSciNet  Google Scholar 

  4. S. C. Kleene.Representation of events in nerve nets, Automata Studies, Princeton (1956), 3–41.

    Google Scholar 

  5. M. O. Rabin and D. Scott:Finite automata and their decision problems, IBM Journal of Research and Development,3 (April 1959), 114–122.

    Article  MathSciNet  Google Scholar 

  6. D. Rees:On semigroups, Proc. of the Cambridge Phil. Soc., (1940), 387–400.

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Israel

    M. Magidor

Authors
  1. M. Magidor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is based on a M.Sc. Thesis prepared at the Hebrew University of Jerusalem under the supervision of Professor M. Rabin. The author is deeply indebted to Professor M. Rabin for his interest and help in this work, and to Professor E. Shamir for his help in preparing this work for publication.

Partially supported by ONR Information Systems Branch Contract No. F 61052-67-0055.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Magidor, M. Decomposition theorems for finite sequential machines. Israel J. Math. 6, 246–260 (1968). https://doi.org/10.1007/BF02760257

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02760257

Keywords

Search

Navigation