Pages that link to "Item:Q553327"
From MaRDI portal
The following pages link to Synchronizing automata with finitely many minimal synchronizing words (Q553327):
Displaying 14 items.
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Synchronizing words and monoid factorization: a parameterized perspective (Q2110733) (← 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)
- Infinite Synchronizing Words for Probabilistic Automata (Q3088047) (← 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)
- (Q5208378) (← links)
- Semisimple synchronizing automata and the Wedderburn-Artin theory (Q5890812) (← links)