Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Synchronizing automata with finitely many minimal synchronizing words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4266486 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Synchronizing Automata and the Černý Conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reset Sequences for Monotonic Automata / rank | |||
Normal rank | |||
Latest revision as of 10:19, 4 July 2024
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
