Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334)
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: Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. |
scientific article |
Statements
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (English)
0 references
17 August 2003
0 references
Cascade products and feedback products
0 references
Algebraic machine theory
0 references
Varieties of formal languages
0 references
Feedback operators on pseudovarieties
0 references
0 references
