The following pages link to (Q3409982):
Displaying 8 items.
- Two decidability problems for infinite words (Q1072715) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- On Post correspondence problem for letter monotonic languages (Q2271434) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
- (Q3773856) (← links)
- (Q4874651) (← links)
- The determinacy strength of pushdown<i>ω</i>-languages (Q5354436) (← links)