Skip to main content
SpringerLink
Log in

Sequential functions and generalized Moore and Mealy automata

  • Automata Theory
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 28))

  • 2035 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbib, M.A. Theories of abstract automata. Prentice-Hall, Inc., Englewood Cliffs 1969

    Google Scholar 

  2. Salomaa, A. Theory of automata. Pergamon Press, Oxford 1969

    Google Scholar 

  3. Ginsburg, S. An introduction to mathematical machine theory. Addison-Wesley Publishing Co., Inc., Reading 1962

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute Czechoslovak Academy of Sciences, Prague

    Jiří Bečvář

Authors
  1. Jiří Bečvář
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bečvář, J. (1975). Sequential functions and generalized Moore and Mealy automata. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_661

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_661

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation