Hardly reachable subsets and completely reachable automata with 1-deficient words (Q5208375)
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: Hardly reachable subsets and completely reachable automata with 1-deficient words |
scientific article; zbMATH DE number 7152084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardly reachable subsets and completely reachable automata with 1-deficient words |
scientific article; zbMATH DE number 7152084 |
Statements
15 January 2020
0 references
\(\Gamma_1\)-graph
0 references
subset reachability
0 references
short reaching word
0 references
reachable automata
0 references
synchronizing automata
0 references
0.8983113169670105
0 references
0.7306777238845825
0 references
0.7259807586669922
0 references
0.7236026525497437
0 references
0.7162590622901917
0 references
