Complexity of Checking Whether Two Automata Are Synchronized by the Same Language (Q5496198)
From MaRDI portal
scientific article; zbMATH DE number 6327634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Checking Whether Two Automata Are Synchronized by the Same Language |
scientific article; zbMATH DE number 6327634 |
Statements
Complexity of Checking Whether Two Automata Are Synchronized by the Same Language (English)
0 references
7 August 2014
0 references
ideal language
0 references
synchronizing automaton
0 references
reset word
0 references
reset complexity
0 references
PSPACE-completeness
0 references
