Pages that link to "Item:Q5092426"

The following pages link to Semicomputable points in Euclidean spaces (Q5092426):

Displaying 9 items.

• Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
• Computational complexity of synchronization under regular commutative constraints (Q2019491) (← links)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
• Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
• Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
• Constrained synchronization and commutativity (Q2235741) (← links)
• Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)