1 / 15

CS729 Automata and Complexity Theory

CS729 Automata and Complexity Theory. Course Organization. Text Book: SJ. E. Hopcroft, R. Motwani, and J. D. Ullman Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, New York, 2001. The 5~8 assignments, midterm and Final.

lpink
Download Presentation

CS729 Automata and Complexity Theory

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. CS729 Automata and Complexity Theory

  2. Course Organization • Text Book: SJ. E. Hopcroft, R. Motwani, and J. D. Ullman Introduction to Automata Theory,Languages, and Computation, Second Edition,Addison-Wesley, New York, 2001. • The 5~8 assignments, midterm and Final. • Each section may have different quizzes. • Weights: As per university policy

  3. What we will do • Automata = abstract computing devices • Turing studied Turing Machines (= computers)before there were any real computers • We will also look at simpler devices thanTuring machines (Finite State Automata, Pushdown Automata, . . . ), and specification means, such as grammars and regular expressions. • NP-hardness = what cannot be efficiently computed

  4. Computation memory CPU Courtesy Costas Busch - RPI

  5. temporary memory input memory CPU output memory Program memory Courtesy Costas Busch - RPI

  6. Example: temporary memory input memory CPU output memory Program memory compute compute Courtesy Costas Busch - RPI

  7. temporary memory input memory CPU output memory Program memory compute compute Courtesy Costas Busch - RPI

  8. temporary memory input memory CPU output memory Program memory compute compute Courtesy Costas Busch - RPI

  9. temporary memory input memory CPU Program memory output memory compute compute Courtesy Costas Busch - RPI

  10. Automaton temporary memory Automaton input memory CPU output memory Program memory Courtesy Costas Busch - RPI

  11. Different Kinds of Automata • Automata are distinguished by the temporary memory • Finite Automata: no temporary memory • Pushdown Automata: stack • Turing Machines: random access memory Courtesy Costas Busch - RPI

  12. Finite Automaton temporary memory input memory Finite Automaton output memory Example: Vending Machines (small computing power) Courtesy Costas Busch - RPI

  13. Pushdown Automaton Stack Push, Pop input memory Pushdown Automaton output memory Example: Compilers for Programming Languages (medium computing power) Courtesy Costas Busch - RPI

  14. Turing Machine Random Access Memory input memory Turing Machine output memory Examples: Any Algorithm (highest computing power) Courtesy Costas Busch - RPI

  15. Power of Automata Finite Automata Pushdown Automata Turing Machine Less power More power Solve more computational problems Courtesy Costas Busch - RPI

More Related