Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460)

From MaRDI portal
Revision as of 21:49, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    9 September 2011
    0 references

    Identifiers