1 / 37

Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science. CS 4384 – 001. Automata Theory. http://www.utdallas.edu/~pervin. Thurs day : Section 2.9 Look at Ullman’s Lecture 7. Tuesday 2-04-14. FEARLESS Engineering. FINAL EXAMINATION. 6 May 2014 2:00pm – 4:45pm S2.312. Rui Li

aletta
Download Presentation

Erik Jonsson School of Engineering and Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Erik Jonsson School of Engineering and Computer Science CS 4384– 001 Automata Theory http://www.utdallas.edu/~pervin Thursday: Section 2.9 Look at Ullman’s Lecture 7 Tuesday2-04-14 FEARLESS Engineering

  2. FINAL EXAMINATION 6 May 2014 2:00pm – 4:45pm S2.312

  3. Rui Li • rxl122350@utdallas.edu • ECSS4.215 • MW 9-11 Teaching Assistant

  4. a) DFA:

  5. b) RE:

  6. From DFA to RE

  7. Decision Problems Martin, P. 148 (1st Ed.)

  8. PUMPING LEMMA M&S P. 68 Theorem 2.9.1

  9. Proof: If A is regular it has a DFA with a finite number, n, of states. Let p = n. Then for any string s in A of length at least p, suppose the decomposition s = xyz satisfies the conditions.

  10. Examples 1-5 from M&S: Classic Examples

  11. If L is regular then so is its complement!

  12. The intersection with a*b* is necessary because the complement contains all strings with a and b out of order!

  13. If the problem was n > m, then choose s = a^{p+1}b^p which is just at the edge of being in L. Then pump DOWN (i=0) since y must consist of a’s.

  14. Extended Pumping Lemma Essentially the same proof!

  15. Theorem: Let M be a DFA with p states. L(M) is not empty iff M accepts a string z with |z| < p. (ii) L(M) has an infinite number of members iff M accepts a string z with p <= |z| < 2p.

  16. Example Seven, M&S P. 72

  17. Example Seven, M&S P. 72

More Related