More decidable instances of Post's correspondence problem: beyond counting
From MaRDI portal
Publication:963345
DOI10.1016/j.ipl.2007.11.002zbMath1186.68266OpenAlexW1986342569MaRDI QIDQ963345
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.002
Cites Work
- Unnamed Item
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- A useful device for showing the solvability of some decision problems
- Extension of the decidability of the marked PCP to instances with unique blocks
- GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS
- Generalized Parikh mappings and homomorphisms
- A Remark on Code Sets and Context-Free Languages
- A variant of a recursively unsolvable problem
- Marked PCP is decidable
This page was built for publication: More decidable instances of Post's correspondence problem: beyond counting
