Pages that link to "Item:Q553327"
From MaRDI portal
The following pages link to Synchronizing automata with finitely many minimal synchronizing words (Q553327):
Displayed 9 items.
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Composition Sequences and Synchronizing Automata (Q2891329) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (Q5890812) (← links)