in Theory of Computation
1,059 views
0 votes
0 votes
L= {<G> | G is CFG and G is NOT ambiguous} .
L is TM recognizable or not even TM recognizable?
in Theory of Computation
1.1k views

12 Comments

Determining whether a CFG is ambiguous is undecidable?
0
0
Yes. ..It is not even semi-decidable. But what about its complement?
0
0

@Soumya

L1 = {<G> | G is CFG and G is ambiguous}. This is Turing recognizable. Read Arjun sir, answer here.
https://gateoverflow.in/19947/which-of-the-folowing-are-r-e

Compliment of L1 should not be Turing recognizable. Otherwise, both L1 and compliment of L1 become decidable.

2
2
Thank you :)
0
0
@Soumya

I think it will be decidable.

L is CFG and not ambiguous

Then it can be CFG or regular grammar

right?
0
0

@srestha. It's not even RE.
Read this

0
0
no that question is different I think

That question is about complement of ambiguous grammar directly.

But, ur question is "Is a CFG is decidable or not"

Suppose $S\rightarrow aSb|ab$ or $S\rightarrow aS|\epsilon$

will it not decidable?
0
0

See the difference

1) wheather L(G) is CFL? is decidable

2)Wheather L(G) is ambiguous ? is undecidable

right?

Do, u think , as CFL is defined on DCFL and not CFL , that is why it is decidable?

Otherwise it will be undecidable?

https://gatecse.in/grammar-decidable-and-undecidable-problems/

0
0

@srestha..
Both are same. 
L is the set of encoding of ALL such CFG's that are not ambiguous. Not just one. 

0
0
but

1) wheather L(G) is CFL? is decidable

So,

why not we make a TM

which accepts all unambiguous grammar?
0
0
@srestha Who told that is decidable?
0
0
when G is DCFG

here  we find ,"if L(G) is CFL" is decidable

right?

--------------------------------------------------------------------------

My question was

 G is CFG

here when we find ,"if L(G) is CFL" is decidable or not?

-----------------------------------------------------------------------------

Moreover , an ambiguous grammar is undecidable.

Does it mean, an unambiguous grammar also need to be undecidable?
0
0

1 Answer

0 votes
0 votes
as L is  CFG  it is subset of UG

that is TM recoznigable

1 comment

who told $L$ is CFL?
1
1

Related questions

0 votes
0 votes
0 answers
3