Advertisement

Some remarks on the algebra of automaton mappings

  • Jürgen Dassow
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. [1]
    I.M. Copi, C.C. Elgot and J.B. Wright, Realization of events by logical nets. J.ACM 5, 181–196 (1958).Google Scholar
  2. [2]
    J. Dassow, Kleene-Mengen und Kleene-Vollständigkeit. EIK 10, 287–295 (1974).Google Scholar
  3. [3]
    J. Dassow, Über zwei abgeschlossene Mengen von Automatenoperatoren. Wiss.Zeitschr.d.Univ.Rostock, Math.-Nat.Reihe 1974, 763–767.Google Scholar
  4. [4]
    J.Dassow, Einige Bemerkungen zu einem modifizierten Vollständigkeitsbegriff für Automatenabbildungen. To appear in Rostokker Math. Kolloquium 3.Google Scholar
  5. [5]
    P. Dömösi, On the semigroup of automaton mappings with finite alphabet. Acta cybernetica 1, 251–254 (1972).Google Scholar
  6. [6]
    J. Horejs, Mappings induced by finite automata. Probl. Kibernetiki 9, 23–26 (1963), (russian).Google Scholar
  7. [7]
    M.I.Kratko, Algorithmic unsolvability of the problem of deciding the completness of finite automata. Dokl.Akad.Nauk 155 (1964), (russian).Google Scholar
  8. [8]
    W.B. Kudrjavcev, On the cardinality of the set of precomplete sets of functional systems related to automata. Probl.Kibernetiki 13, 45–74 (1965), (russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Jürgen Dassow
    • 1
  1. 1.Department of MathematicsWilhelm-Pieck-University RostockRostockGDR

Personalised recommendations