On input semigroups of automata (Q5582346)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3300610
Language Label Description Also known as
default for all languages
No label defined
    English
    On input semigroups of automata
    scientific article; zbMATH DE number 3300610

      Statements

      On input semigroups of automata (English)
      0 references
      0 references
      1970
      0 references
      languages, automata, networks
      0 references
      automata
      0 references
      topological semigroups
      0 references
      input semigroups
      0 references
      In this paper, we consider the problem of what topological semigroups can serve as input semigroups of what (topological) automata. A semigroup is said to be admissible if it serves as an input semigroup of a non-trivial ``strongly connected'' automaton that has a distinguishable state. For the discrete or the compact case, the class of all the admissible semigroups is fully characterized: a discrete or compact topological semigroup \((I, m)\) is admissible if and only if there exists a closed congruence relation \(R\) such that the quotient semigroup \((I/R, m_R)\) is non-trivial, right simple, and left unital. This work stems from \textit{G. P. Weeg}'s [J. Assoc. Comput. Mach. 9, 345--349 (1962; Zbl 0137.25004)], who considered a similar problem in the discrete case. In the last section of the paper, a conjecture of Weeg [loc. cit., p. 264] is resolved in the negative.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references