Advertisement

Composition of automata

  • Ferenc Gécseg
Thursday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gécseg, F., On loop-free composition of automata, Acta Sci. Math. 26 (1965), 269–272 (Russian).Google Scholar
  2. [2]
    Gécseg, F., On R-products of automata, II., Studia Sci. Math. Hung. 1 (1966), 443–447.Google Scholar
  3. [3]
    Gécseg, F., Families of automaton mappings, Acta Sci. Math. 28 (1967), 39–54 (Russian).Google Scholar
  4. [4]
    Gécseg, F., S. Székely, On equational classes of unoids, Acta Sci. Math. 34 (1973), 99–101.Google Scholar
  5. [5]
    Gluškov, V.M., Theory of abstract automata, Uspehi Matem. Nauk 16 (1961), 3–62 (Russian).Google Scholar
  6. [6]
    Hartmanis, J., Loop-free structure of sequential machines, Inform. Control 5 (1962), 25–44.CrossRefGoogle Scholar
  7. [7]
    Mal'cev, A.I., Algebraic systems (Moskva, 1970) (Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Ferenc Gécseg
    • 1
  1. 1.Szeged

Personalised recommendations