Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A method for minimizing the number of states for a restricted class of incompletely specified sequential machines

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Summary

In this paper are considered incompletely specified sequential machines for which the only unspecified entries are those which occur because of a restriction on the input states which can directly follow each possible input state.

For these machines the minimum number of states is equal to the chromatic number of the graph of all pairs of incompatible states. A new method for determining a minimum-class partition of the set of states which is formed from compatible classes is given.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. C. Berge,Théorie des Graphes et ses Applications, Dunod, Paris, 1963.

    Google Scholar 

  2. E. J. McCluskey, jr., Minimum-State Sequential Circuits for a Restricted class of Incompletely Specified Flow Tables, The Bell System Technical Journal, XLI, 6, 1962, pp. 1759–1768.

  3. R. E. Miller,Switching Theory, II, Wiley, New York, 1966.

    Google Scholar 

  4. I. Tomescu, Sur un problème de partition avec un nombre minimal de classes,C. R. Acad. Sci. Paris 265 (1967), 645–648.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bucharest, Bucharest, Romania

    Ioan Tomescu

Authors
  1. Ioan Tomescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tomescu, I. A method for minimizing the number of states for a restricted class of incompletely specified sequential machines. Math. Systems Theory 6, 1–2 (1972). https://doi.org/10.1007/BF01706068

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation