Unformatted text preview: c k  m â‰¥ k âˆ§ n â‰¥ 5 âˆ§ m,n,k âˆˆ N } 8. { a m b n c k  n > m + k âˆ§ m,n,k âˆˆ N } II. PDA and Contextfree languages: 1. Give a contextfree grammar that generates language L = { uu R cvv R  u,v âˆˆ { a,b } * } . 2. Design a PDA M = ( K, Î£ , Î“ , Î” ,s,F ) accepting the language L ....
View
Full Document
 Spring '09
 XiaogangJin
 Computer Science, Formal language, Formal languages, Contextfree grammar, contextfree language, Seymour Ginsburg

Click to edit the document details