Pages that link to "Item:Q2811343"
From MaRDI portal
The following pages link to Synchronizing Automata over Nested Words (Q2811343):
Displaying 9 items.
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Infinite Synchronizing Words for Probabilistic Automata (Q3088047) (← links)
- Synchronizing Data Words for Register Automata (Q4608573) (← links)
- (Q5002830) (← links)