Complexity of road coloring with prescribed reset words (Q2424693)
From MaRDI portal
(Redirected from Item:Q2799170)
| 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: Complexity of road coloring with prescribed reset words |
scientific article; zbMATH DE number 6566775
- Complexity of Road Coloring with Prescribed Reset Words
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of road coloring with prescribed reset words |
scientific article; zbMATH DE number 6566775 |
|
Statements
Complexity of road coloring with prescribed reset words (English)
0 references
Complexity of Road Coloring with Prescribed Reset Words (English)
0 references
25 June 2019
0 references
8 April 2016
0 references
synchronizing word
0 references
reset word
0 references
road-coloring problem
0 references
synchronizing automata
0 references
Černý conjecture
0 references
algorithms on automata and words
0 references
road-coloring theorem
0 references
0 references
0 references
0.978922426700592
0 references
0.8190793991088867
0 references
0.8111879229545593
0 references
0.8111463189125061
0 references