Unformatted text preview: L G L = I . 2. Design a pda that accepts the all strings of a’s and b’s in which no prefix has more b’s than a’s. You may use acceptance by final state or empty pushdown store, which ever you find more convenient. (Please indicate which you chose.) 3. 7.1.2 4. 7.2.1 c and e 5. Prove that min(L) cannot be expressed in terms of h, h1 , and intersection with regular sets. (Note: L can be absolutely any language. As a place to start, examine min(L) where L is context free.)...
View
Full
Document
This note was uploaded on 11/07/2009 for the course CS 3810 taught by Professor Hopcroft during the Fall '07 term at Cornell.
 Fall '07
 HOPCROFT

Click to edit the document details