This preview shows page 1. Sign up to view the full content.
Unformatted text preview: A such that L( A ) = L. In case (b), build a PDA D and a formal grammar G such that L( D ) = L(G) = L. 3. Is any finite language regular? Prove that your answer is correct....
View Full Document
- Spring '09