Reset complexity and completely reachable automata with simple idempotents (Q2112183): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reset complexity and completely reachable automata with simple idempotents |
scientific article |
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
