0 votes 0 votes $\text{Recursive languages are also called type 0 languages. state true or false with explanation}$ Theory of Computation theory-of-computation + – varunraj asked Mar 21, 2018 • edited Mar 24, 2018 by Sukanya Das varunraj 654 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply ankitgupta.1729 commented Mar 21, 2018 reply Follow Share "Type -0 Grammar generates exactly "all" languages that can be recognized by a Turing Machine " Since There is a Halting Turing Machine (HTM) for a Recursive Language and Since HTM does not accept all the languages which a Standard Turing Machine accept..So , It is violating the definition..So, It proves that Type 0 grammar is not equivalent to Recursive Languages..please refer https://en.wikipedia.org/wiki/Chomsky_hierarchy 1 votes 1 votes varunraj commented Mar 21, 2018 reply Follow Share tq ankitgupta.1729 1 votes 1 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes false Type 0 grammar language are recognized by turing machine. These languages are also known as the recursively enumerable languages. recursive language is proper subset of recursive enumerable language. and every recursive enumerable language is not recursive languages. so it should be false. abhishekmehta4u answered Mar 21, 2018 • selected Mar 21, 2018 by Prashant. abhishekmehta4u comment Share Follow See all 3 Comments See all 3 3 Comments reply varunraj commented Mar 21, 2018 reply Follow Share tqsm abhishekmehta4u 0 votes 0 votes shivanisrivarshini commented Mar 21, 2018 reply Follow Share Then where recursive comes ? 0 votes 0 votes varunraj commented Mar 21, 2018 reply Follow Share The class of all recursive languages is often called R, although this name is also used for the class RP. This type of language was not defined in the Chomsky hierarchy of (Chomsky 1959) refer:https://en.wikipedia.org/wiki/Recursive_language 2 votes 2 votes Please log in or register to add a comment.
