Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 10:38, 5 March 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