A Remark on Code Sets and Context-Free Languages
From MaRDI portal
Publication:4065056
DOI10.1109/T-C.1975.224294zbMath0307.68058MaRDI 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
68Q45: Formal languages and automata
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
On some variants of Post's correspondence problem, More decidable instances of Post's correspondence problem: beyond counting, 2DST mappings of languages and related problems, A useful device for showing the solvability of some decision problems