This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: D j if the state accepts only decimal integers; DH j if the state can accept both decimal integers and hexadecimal numbers; and H j if the state can accept only hexadecimal numbers (where j is some index of the state). (7) Convert the FSA given below to a regular expression. You must follow the procedure presented in class. s2 s1 a a a b b b s0 (8) What is model theory? (9) What is Godels Completeness Theorem? How is it dierent from the soundness theorem? (10) (Extra Credit  Due on April 1) Let L be the set of strings that agree with some initial part of the pattern 0 1 10 2 10 3 10 4 10 5 ... . Thus L = { , 01 , 010 , 0100 , 01001 , 010010 , 0100100 ,... } . Using the Pumping Lemma, prove that L is not a regular language....
View Full
Document
 Spring '09
 Nhut

Click to edit the document details