What if given grammar is ambiguous?

The Gateway to Computer Science Excellence

+32 votes

Which of the following are decidable?

- Whether the intersection of two regular languages is infinite
- Whether a given context-free language is regular
- Whether two push-down automata accept the same language
- Whether a given grammar is context-free

- I and II
- I and IV
- II and III
- II and IV

+35 votes

Best answer

Lets see options one by one :

- The language here will be regular as intersection of regular languages will lead to regular language only. And we know that given a regular language, whether it is finite or not is a decidable problem. This can be seen by observing the DFA -- if DFA contains a state which contains a loop and that state is reachable from the start state and that state is either a final state or leading to final state, then the language will be infinite.

- The regularity property is undecidable for context free languages. Hence, it is undecidable. Details regarding this : https://cs.stackexchange.com/questions/19482/why-is-deciding-regularity-of-a-context-free-language-undecidable

- Now equivalence of two CFLs is also an undecidable property. Hence, given $2$ PDAs which is nothing but characterizing CFLs, whether the $2$ CFLs will be same or not cannot be decided.

- Given a grammar, it is context free iff its productions are of the type $V \to ( V \cup \Sigma )^*$ which can be verified with a Turing machine. Hence, it is a decidable property..

**Hence, (B) should be correct answer.**

+21 votes

(1) Intersection of two regular languages is regular. And checking if a regular language is infinite is decidable.

(2) Undecidable

(3) Undecidable

(4) Decidable as we just have to check if the grammar obeys the rules of CFG. (Obviously undecidable had it been language instead of grammar)

Reference: http://gatecse.in/wiki/Grammar:_Decidable_and_Undecidable_Problems

(2) Undecidable

(3) Undecidable

(4) Decidable as we just have to check if the grammar obeys the rules of CFG. (Obviously undecidable had it been language instead of grammar)

Reference: http://gatecse.in/wiki/Grammar:_Decidable_and_Undecidable_Problems

0

How do we go about solving such questions ?

We need to learn the decidable and undecidable properties as such or is there any logic behind this ?

We need to learn the decidable and undecidable properties as such or is there any logic behind this ?

0

Why (2) is undecidable? if we simplify the CFG and compare the resulting grammar with chomsky form for RL then we can tell about it.

0

Sir, In point no. 4. How can you say that checking if language is context-free is undecidable ?

Can't we make a PDA and check ?

Can't we make a PDA and check ?

+2

whether a grammar is context-free or not we can determine it by checking for CFG property on the grammar, not by CYK algorithm. The CYK algorithm is used to check whether a given string could be generated by a CFG grammar or not. and YES if it were language instead of grammar that is undecidable.

52,345 questions

60,511 answers

201,930 comments

95,354 users