On input semigroups of automata

From MaRDI portal
Publication:5582346





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.











This page was built for publication: On input semigroups of automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5582346)