The Representation of Many-One Degrees by the Word Problem for Thue Systems
From MaRDI portal
Publication:5666541
DOI10.1112/plms/s3-26.1.184zbMath0253.02042MaRDI QIDQ5666541
Publication date: 1973
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-26.1.184
03D40: Word problems, etc. in computability and recursion theory
03D30: Other degrees and reducibilities in computability and recursion theory
03D03: Thue and Post systems, etc.
Related Items
Many-one degrees associated with semi-Thue systems, Combinatorial systems defined over one- and two-letter alphabets, Diem-Grade Logischer Entscheidungsprobleme