The following pages link to Marked PCP is decidable (Q5941069):
Displaying 8 items.
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- Binary (generalized) Post Correspondence Problem (Q1605309) (← links)
- String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems (Q5458840) (← links)