Skip to main content
SpringerLink
Log in

Structural equivalence of automata

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

References

  1. A. Ginzburg andM. Yoeli, Products of automata and the problem of covering,Trans. Amer. Math. Soc. 116 (1965), 253–266.

    Google Scholar 

  2. A. Ginzburg,Algebraic Theory of Automata, Academic Press, New York, 1968.

    Google Scholar 

  3. J. Hartmanis andR. E. Stearns,Algebraic Structure Theory of Sequential Machines, Prentice-Hall, Englewood Cliffs, N.J., 1966.

    Google Scholar 

  4. Stephen Hedetniemi, Homorphisms of graphs, Technical Report, University of Michigan, 1965.

  5. C. L. Liu, Pair algebras, lattice functions and finite-state machines,J. Assoc. Comput. Mach. (1969), 442–454.

  6. D. Muller, Lecture notes on binary relations, University of Michigan, 1968.

  7. R. T. Yeh, On relational homomorphisms of automata,Information and Control 12 (1968), 140–155.

    Google Scholar 

  8. R. T. Yeh, Generalized pair algebra with applications to automata theory,J. Assoc. Comput. Mach. 15 (1968), 304–316.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas, Austin, Texas, USA

    Raymond T. Yeh

Authors
  1. Raymond T. Yeh
    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

Yeh, R.T. Structural equivalence of automata. Math. Systems Theory 4, 198–211 (1970). https://doi.org/10.1007/BF01691104

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation