Pages that link to "Item:Q3091460"
From MaRDI portal
The following pages link to Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460):
Displayed 4 items.
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)