Semigroup automaton structure by homomorphism and domain partition (Q1182316)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semigroup automaton structure by homomorphism and domain partition |
scientific article |
Statements
Semigroup automaton structure by homomorphism and domain partition (English)
0 references
28 June 1992
0 references
It is shown that analysis of the ranges and domain partitions of input functions of an automaton, combined with existing necessary and sufficient conditions for the existence of morphisms on singly generated automata, can lead to strong theorems on the structure of the semigroup automaton and significant improvement in existing algorithms.
0 references
domain partitions
0 references
input functions
0 references
automaton
0 references
singly generated automata
0 references
