I hope that you find it to be an interesting and enjoyable thing. 教学大纲 Teaching Syllabus 1. Introduction and Overview 2. Finite Automata 3. NFAs vs. DFAs 4. Regular Expressions 5. The Pumping Lemma and Nonregular languages 6. Context Free Grammars 7. ...
3. Use the pumping lemma to prove that { } | j i Labij = ≤is not regular. 4. Use homomorphism, inversehomomorphisms and intersection with regular sets to express the setobtained from an arbitrary set L by deleting in each string every 1appearing in an even numbered ...