Skip to main content
Springer Nature Link
Log in

Composition of Automata

  • Conference paper
Automata, Languages and Programming (ICALP 1974)

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

Included in the following conference series:

Abstract

It is a common problem of all branches of mathematics to represent an object (algebraic structure, function etc.) by using other-possibly simpler — ones. Similarly, in the theory of automata such investigations are useful for two reasons. (1) For practical reasons, real automata are composed of various elements of certain type. (2) Several properties of a composition of automata can be deduced from those of its factors.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
CHF34.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

Chapter
CHF 24.95
Price includes VAT (Switzerland)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
CHF 42.50
Price excludes VAT (Switzerland)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
CHF 53.60
Price excludes VAT (Switzerland)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gécseg, F., On loop-free composition of automata, Acta Sci. Math. 26 (1965), 269–272 (Russian).

    Google Scholar 

  2. Gécseg, F., On R-products of automata, II., Studia Sci. Math. Hung. 1 (1966), 443–447.

    Google Scholar 

  3. Gécseg, F., Families of automaton mappings, Acta Sci. Math. 28 (1967), 39–54 (Russian).

    Google Scholar 

  4. Gécseg, F., S. Székely, On equational classes of unoids, Acta Sci. Math. 34 (1973), 99–101.

    MATH  Google Scholar 

  5. Gluékov, V.M., Theory of abstract automata, Uspehi Matem. Nauk 16 (1961), 3–62 (Russian).

    Google Scholar 

  6. Hartmanis, J., Loop-free structure of sequential machines, Inform. Control (1962), 25–44.

    Google Scholar 

  7. Malcev, A.I., Algebraic systems ( Moskva, 1970 ) ( Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Szeged, Hungary

    Ferenc Gécseg

Authors
  1. Ferenc Gécseg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, 66 Saarbrücken/BRD, Deutschland

    Jacques Loeckx

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gécseg, F. (1974). Composition of Automata. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21545-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06841-9

  • Online ISBN: 978-3-662-21545-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation

  NODES
INTERN 1
Note 2