Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete |
scientific article |
Statements
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (English)
0 references
9 September 2011
0 references
