On structure and representations of cyclic automata (Q897902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On structure and representations of cyclic automata |
scientific article; zbMATH DE number 6517451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On structure and representations of cyclic automata |
scientific article; zbMATH DE number 6517451 |
Statements
On structure and representations of cyclic automata (English)
0 references
8 December 2015
0 references
The authors deal with finite one-generated unary algebras (that is, finite semiautomata with all states reachable from a single state) such that every element is an image of some generator under an endomorphism, and this generator is uniquely determined, up to automorphisms of the algebra. Some results about the structure of such algebras are proved, in particular in the case that the endomorphism monoid is either a semilattice or a semilattice of groups.
0 references
finite unary algebras
0 references
endomorphism monoids
0 references
semiautomata
0 references
Clifford monoids
0 references
0.7890297174453735
0 references
0.7792964577674866
0 references
0.771822452545166
0 references
