A Remark on Code Sets and Context-Free Languages

DOI10.1109/T-C.1975.224294zbMATH Open0307.68058OpenAlexW1981472941MaRDI QIDQ4065056FDOQ4065056

Authors: Sheila A. Greibach 

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (4)

• 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
• On some variants of Post's correspondence problem

This page was built for publication: A Remark on Code Sets and Context-Free Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065056)