CS 454 Theory of Computation
-
Upload
francois-lesage -
Category
Documents
-
view
40 -
download
3
description
Transcript of CS 454 Theory of Computation
![Page 1: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/1.jpg)
CS 454 Theory of Computation
Sonoma State University, Fall 2012Instructor: B. (Ravi) Ravikumar
Office: 116 I Darwin Hall
![Page 2: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/2.jpg)
Lecture 1
Goals:• overview (45 minutes)• Course overview• Field overview
• Chapter 1 (55 minutes)
![Page 3: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/3.jpg)
What is theory of computation?
Theory of computation deals with computational models – what they can and can’t do.
Computational models: instead of defining it, we will give some examples.
• Cellular automaton
• L-system
• finite automaton
![Page 4: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/4.jpg)
![Page 5: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/5.jpg)
![Page 6: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/6.jpg)
Virtual cities generated using L systems
![Page 7: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/7.jpg)
Course overview
finite automata• DFA, NFA, regular expressions• proof of equivalence, algorithms for conversions• What can’t be done by FA?• DFA minimization
• context-free languages• grammar, pushdown automaton• equivalence• what can’t be done by cfg’s?
![Page 8: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/8.jpg)
• Turing machines• computability• variations of Turing machines• reductions, unsolvability• other computational models
• Complexity Theory• time complexity• NP-completeness
• Other topics• applications (e.g. compilers, image compression, graphics etc.)• cryptography, interactive proof systems• biologically inspired models of computation
![Page 9: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/9.jpg)
9
Why Study Theory of Computation? From Stanford survey (Jeff Ullman)
A survey of Stanford grads 5 years out asked which of their courses did they use in their job.
Basics like CS106 (~ CS 215) took the top spots, of course.
But among optional courses, CS 154 stood remarkably high.3X the score for AI, for example.
![Page 10: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/10.jpg)
10
How Could That Be?
Regular expressions are used in many systems.E.g., UNIX a.*b.E.g., DTD's (Document Type Definition)
describe XML tags with a RE format like person (name, addr, child*).
Finite automata model protocols, electronic circuits.Theory is used in model-checking.
![Page 11: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/11.jpg)
11
How? – (2)
Context-free grammars are used to describe the syntax of essentially every programming language.Not to forget their important role in
describing natural languages. And DTD’s taken as a whole, are
really CFG’s.
![Page 12: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/12.jpg)
12
How? – (3)
When developing solutions to real problems, we often confront the limitations of what software can do.Undecidable things – no program
whatever can do it.Intractable things – there are programs,
but no fast programs.CS 454 (and CS 415) give you the
tools.
![Page 13: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/13.jpg)
13
Other aspects of CS 454
We’ll learn how to deal formally with discrete systems.Proofs: You never really prove a program correct,
but you need to be thinking of why a tricky technique really works.
Abstract models are important to design and understand complex software. Abstract State Machine used to design Microsoft
productsState Charts play a key role in software systems.
![Page 14: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/14.jpg)
14
Text
Hopcroft, Motwani, Ullman, Automata Theory, Languages, and Computation 3rd Edition.
Goal is to cover roughly ¾ of the book.
![Page 15: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/15.jpg)
15
Gradiance Registration
The “class token” for this edition of CS 454 is 7AC0798E
Register it at www.gradiance.com
![Page 16: CS 454 Theory of Computation](https://reader036.fdocuments.in/reader036/viewer/2022062408/568138a8550346895da0674d/html5/thumbnails/16.jpg)
16
Homework
The intent is that everyone will get 100% on all homeworks.
You are allowed to try as many times as you like.Only the last try counts.
Don’t be afraid to guess and try again.
You’ll get some advice if you make a mistake.