On the computational complexity of problems related to distinguishability sets (Q1706155)
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: On the computational complexity of problems related to distinguishability sets |
scientific article; zbMATH DE number 6851689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of problems related to distinguishability sets |
scientific article; zbMATH DE number 6851689 |
Statements
On the computational complexity of problems related to distinguishability sets (English)
0 references
21 March 2018
0 references
distinguishability sets
0 references
synchronization
0 references
computational complexity
0 references
state complexity
0 references
deterministic finite automata
0 references
