Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755)
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: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata |
scientific article; zbMATH DE number 6803499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata |
scientific article; zbMATH DE number 6803499 |
Statements
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (English)
0 references
7 November 2017
0 references
synchronization
0 references
automata
0 references
directing words
0 references
computational complexity
0 references
0 references
0.9447514
0 references
0.9019554
0 references
0.8846918
0 references
0.8802528
0 references
0.87833583
0 references
0.87749827
0 references
0.87749827
0 references
