1 / 54

Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science. CS 4384 – 0 01. Automata Theory. http://www.utdallas.edu/~pervin. Thursday: EXAMINATION II Tuesday: Chapter Four. Tuesday 4-08-14. FEARLESS Engineering.

zeph-hogan
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: EXAMINATION II Tuesday: Chapter Four Tuesday4-08-14 FEARLESS Engineering

  2. A search of Albert Einstein's archived manuscripts last year turned up a draft of an early unpublished paper by the famed physicist that concluded, mistakenly, that new matter, such as stars and galaxies, would appear to fill the expanding universe. Einstein was attempting to make sense of Edwin Hubble's observation that the universe was expanding, but he made a mathematical error. When he discovered his mistake, he set aside the paper, which is now in a digital archive of his papers at the Hebrew University in Jerusalem. Waterford Institute of Technology physicist Cormac O'Raifeartaigh and colleagues found the paper while scouring the archive.

  3. Context-free Languages Chapter Three

  4. Note: You can combine the START and C states and get:

  5. Review Problems

  6. Done in class

  7. Done in class

  8. Done in class

  9. Deterministic Pushdown Automata

  10. Martin, P. 172 Corrected

  11. Martin, P. 224

  12. Martin, P. 225 (corrected)

  13. Deterministic Context-Free Languages

  14. Parsing LL(k) Grammars

  15. PRACTICE CFG+PDA+CFL+PL

  16. More Practice

  17. Linz, P.221 #4

  18. Linz, P. 221 #5

  19. Just reverse the right-hand sides of the productions when put in Chomsky Normal Form!

  20. M&S Exercises

  21. Sample Test

  22. (Nothing “useless”) Example 3.4.1 on P. 105ff M&S

  23. End of Test!

  24. A and B are messengers

  25. Preview of Coming Attractions

  26. ALGORITHMS 1900 - David Hilbert - ICM in Paris - 23 mathematical problems 10th problem: Devise a process according to which it can be determined by a finite number of operations whether a polynomial has an integral root. An “algorithm” (assumed it must exist) 1930 Kurt Gödel - Incompleteness Theorems 1932 Lambda-Calculus; Post Correspondence; Combinatory Logic 1936 Alonzo Church and Alan Turing (Church-Turing Thesis) 1970 Yuri Matijasevič (Martin Davis, Hilary Putnam, Julia Robinson) AlanTuring

  27. Turing Machines Effective Computability

  28. Turing Machine (Alan Turing, 1936) • Post Systems (Emil Post, 1936) • μ-recursive functions (Kurt Gödel) • λ-calculus (Alonzo Church, 1932) • Combinatory logic (Haskell B Curry, 1929) Attempts to define effective computability

  29. Alan Matheson Turing

  30. Princeton Alumni Magazine

More Related