search
Log In
0 votes
171 views

Ans will be

in Theory of Computation 171 views
0
II and III

Type 0 grammar language are recognized by turing machine. These languages are also known as the recursively enumerable languages
0

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
@mk

3 is also wrong as for one grammar there can be multiple regular expression.
0
yes 3rd cant be correct .

and why 1st one is false ?

total turing machine is some different from re ??
0

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
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

minal maan liya :p saare options galat fir?

0
1st is also wrong. total tm means recursive
0
@mk
All options appear to be wrong.
Only 2 is correct.

Please log in or register to answer this question.

Related questions

0 votes
2 answers
1
122 views
What language does the grammar with these productions generate? S->Aa A->B B->Aa
asked Jun 27, 2018 in Theory of Computation saumya mishra 122 views
0 votes
1 answer
2
449 views
Find the regular grammar for $L=\{a^nb^m \mid n+m \text{ is even}\}$
asked Apr 14, 2018 in Theory of Computation Shubham Kumar 7 449 views
0 votes
2 answers
3
571 views
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KB plzzz check this A and D are already eliminated Option B and C are equivalent or not… Any string which I’m taking is getting accepted in both B and C If they are not equal plzz give the reason
asked Apr 2, 2018 in Theory of Computation sanju77767 571 views
1 vote
0 answers
4
...