0 votes 0 votes Ans will be minal asked Sep 22, 2018 minal 680 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Mk Utkarsh commented Sep 22, 2018 reply Follow Share II and III Type 0 grammar language are recognized by turing machine. These languages are also known as the recursively enumerable languages 0 votes 0 votes Swapnil Naik commented Sep 22, 2018 reply Follow Share How 3 is correct? A regular expression can be represented by more than one grammar, there will be many to one correspondence. https://gateoverflow.in/156753/state-true-or-false-classes-grammar-and-respective-automata 0 votes 0 votes smsubham commented Sep 22, 2018 reply Follow Share @mk 3 is also wrong as for one grammar there can be multiple regular expression. 0 votes 0 votes minal commented Sep 22, 2018 reply Follow Share yes 3rd cant be correct . and why 1st one is false ? total turing machine is some different from re ?? 0 votes 0 votes Mk Utkarsh commented Sep 22, 2018 reply Follow Share minal TTM are machines that always halt that means it can accept only recessive languages. smsubham how for one grammar there are multiple regex? sorry about my ignorance i actually was skeptical about III but was sure about 1st and 2nd so opted for best possible option which was D 0 votes 0 votes minal commented Sep 22, 2018 reply Follow Share i can write any re in form left resolution and right resolution ..so same grammar can have multiple expression even (a+b)^* can write in multiple way right .3 one is for sure wrong 0 votes 0 votes Mk Utkarsh commented Sep 22, 2018 reply Follow Share minal maan liya :p saare options galat fir? 0 votes 0 votes minal commented Sep 22, 2018 reply Follow Share 1st is also wrong. total tm means recursive 0 votes 0 votes smsubham commented Sep 22, 2018 reply Follow Share @mk All options appear to be wrong. Only 2 is correct. 0 votes 0 votes Please log in or register to add a comment.