Skip to main content
SpringerLink
Log in

Some classes of automata as partially ordered sets

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A class of Σautomata is considered as a partially ordered set by homomorphism relation. We show first that some classes of automata. e.g., quasiperfect automata, perfect automata and strongly cofinal automata, are lattices, and other classes, e.g., strongly connected automata, cyclic automata and cofinal automata, are not lattices. At the same time, we give algorithms for computing the least upper bound and the greatest lower bound of given two elements in each class which forms a lattice.

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. R. Bayer. Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras, Rept. no. 204, Dept. of Computer Science. Univ. of Illinois (1966).

  2. G. Birkhoff. Lattice Theory, Providence, RI.AMS (1967).

  3. S. Eilenberg. Automata, Languages and Machines, Vol. B, Academic Press (1976).

  4. A. C. Fleck. Isomorphism Groups of Automata,J. ACM 9, 469–476 (1962).

    Google Scholar 

  5. A. C. Fleck. On the Automorphism Group of an Automaton.J. ACM 12, 566–569 (1965).

    Google Scholar 

  6. A. Ginzburg. Algebraic Theory of Automata. Academic Press (1968).

  7. J. W. Grzymala-Busse. On the Strongly Related Automata, Foundations of Control Engineering 3, 3–8 (1978).

    Google Scholar 

  8. J. Hartmanis and R. E. Stearns. Algebraic Structure Theory of Sequential Machines. Prentice-Hall (1966).

  9. M. Ito. A Representation of Strongly Connected Automata and Its Applications,J. CSS 17, 65–80 (1978).

    Google Scholar 

  10. M. Ito. Input Sets of Strongly Connected Automata, Fundamentals of Computation Theory, Band 2, 187–192 (1979).

    Google Scholar 

  11. Y. Masunaga, N. Noguchi and J. Oizumi. A Structure Theory of Automata Characterized by Group,J. CSS 7, 300–305 (1973).

    Google Scholar 

  12. C. A. Trauth, Jr. Group-Type Automata,J. ACM 13, 170–175 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Kyoto Sangyo University, Kyoto, Japan

    Masami Ito

Authors
  1. Masami Ito
    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

Ito, M. Some classes of automata as partially ordered sets. Math. Systems Theory 15, 357–370 (1981). https://doi.org/10.1007/BF01786991

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation