A Remark on Code Sets and Context-Free Languages
From MaRDI portal
Publication:4065056
DOI10.1109/T-C.1975.224294zbMath0307.68058OpenAlexW1981472941MaRDI QIDQ4065056
Publication date: 1975
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1975.224294
Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
2DST mappings of languages and related problems, More decidable instances of Post's correspondence problem: beyond counting, A useful device for showing the solvability of some decision problems, On some variants of Post's correspondence problem