Abstract
AbstractThis chapter is devoted to the study of the decidability and undecidability properties of (i) the context-free languages, (ii) the deterministic context-free languages, and (iii) the linear context-free languages. We also present the Post Theorem about recursively enumerable sets, the Turing Theorem on the Halting Problem, and the Greibach Theorem about the undecidability of a property for classes of languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
