Cheap and Secure Web Hosting Provider : See Now

How to construct CFG for language

, , No Comments
Problem Detail: 

We have alphabet $\Sigma = \{ { a, b} \} $.

How to construct CFG for language $\Sigma^{\ast} - \{a^{n}b^{n} | n \ge 0 \}$.

I suggest that is very easy, but I can't invent. I know PDA for this language if it can help.

Asked By : marka_17
Answered By : Hendrik Jan

Split into parts that you can handle. All strings not of the form $a^*b^*$. All strings of the form $a^ib^j$ with $i< j$. Then all strings ....

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/65428

3200 people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback