The Gateway to Computer Science Excellence
0 votes
68 views

Ans will be

in Theory of Computation by Boss (17.1k points) | 68 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.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,309 answers
198,337 comments
105,023 users