This preview shows page 1. Sign up to view the full content.
Unformatted text preview: L G L = I . 2. Design a pda that accepts the all strings of as and bs in which no prefix has more bs than as. 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, h-1 , 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
- Fall '07