scientific article; zbMATH DE number 2087488
From MaRDI portal
Publication:4738288
zbMath1060.03068MaRDI QIDQ4738288
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2300/23000057.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (3)
Extension of the decidability of the marked PCP to instances with unique blocks ⋮ Decidability of the binary infinite Post Correspondence Problem ⋮ Undecidability of infinite post correspondence problem for instances of Size 9
This page was built for publication:
