Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W143622594 / rank | |||
Normal rank | |||
Revision as of 23:21, 19 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
