Synchronizing automata with finitely many minimal synchronizing words (Q553327)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5932332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Synchronizing automata with finitely many minimal synchronizing words |
scientific article; zbMATH DE number 5932332 |
Statements
Synchronizing automata with finitely many minimal synchronizing words (English)
0 references
27 July 2011
0 references
synchronizing automata
0 references
minimal synchronizing words
0 references
co-NP-hard problems
0 references
0.9357089400291444
0 references
0.8687306046485901
0 references
0.8507000207901001
0 references
0.8478399515151978
0 references
0.845657229423523
0 references
