Reset complexity and completely reachable automata with simple idempotents (Q2112183)
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: Reset complexity and completely reachable automata with simple idempotents |
scientific article; zbMATH DE number 7643465
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reset complexity and completely reachable automata with simple idempotents |
scientific article; zbMATH DE number 7643465 |
Statements
Reset complexity and completely reachable automata with simple idempotents (English)
0 references
18 January 2023
0 references
finite automata
0 references
synchronization
0 references
set of synchronizing words
0 references
automata with simple idempotents
0 references
completely reachable automata
0 references
sync-maximal automata
0 references
0 references
0 references
