Pages that link to "Item:Q1678755"

The following pages link to Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755):

Displayed 20 items.

• On automata recognizing birecurrent sets (Q1625603) ‎ (← links)
• The complexity of synchronizing Markov decision processes (Q1740670) ‎ (← links)
• Distributed graph problems through an automata-theoretic Lens (Q2117706) ‎ (← links)
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) ‎ (← links)
• Careful synchronization of partial deterministic finite automata (Q2170286) ‎ (← links)
• Preimage problems for deterministic finite automata (Q2208257) ‎ (← links)
• Distributed graph problems through an automata-theoretic lens (Q2689441) ‎ (← links)
• Synchronizing Automata over Nested Words (Q2811343) ‎ (← links)
• Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) ‎ (← links)
• Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) ‎ (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) ‎ (← links)
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) ‎ (← links)
• (Q5089200) ‎ (← links)
• Semicomputable points in Euclidean spaces (Q5092426) ‎ (← links)
• (Q5111624) ‎ (← links)
• Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) ‎ (← links)
• (Q5227517) ‎ (← links)
• Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) ‎ (← links)
• Synchronization of Parikh automata (Q6067332) ‎ (← links)
• Synchronizing deterministic push-down automata can be really hard (Q6186317) ‎ (← links)