Lecture 2: Finite Automata
David L. Dill
Department of Computer Science
1
Outline
•
Proof guidelines.
•
Introduction to regular languages.
•
Deterministic finite automata (DFA)
•
Nondeterministic finite automata (NFA)
•
Proof that NFA and DFA languages are the same (subset construction).
2
Proof Expectations
We don’t want to lose sight of the forest because of the trees.
Here are the “forestlevel” points with proofs.
•
What is the proof strategy?
–
Induction on strings.
What are the base and induction steps?
–
Induction on expressions.
What are the base and induction steps?
–
Diagonalization
–
Reduction from another problem.
Which direction is the reduction?
•
What are the key insights in the proof?
•
Often this is a construction (often something that can be implemented as a
computer program)
–
Translation between regular expressions, various finite automata.
–
Translation from one problem to another.
Make sure your document explain these things clearly in your proofs.
If we can see QUICKLY that you did the right kind of proof and got the major
points right, you’ll get nearly full credit.
3
Proof Guidelines
1. State what is being proved precisely and clearly.
2. Start proof with an explanation of the strategy (e.g. “induction on
y
”)
3. Provide guideposts (e.g.,
Base
,
Induction
)
4. Highlight the interesting key parts of the proof (where did you have to be
clever?)
5. Make it easy for the graders to see these things.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Winter '08
 Motwani,R
 Regular expression, Nondeterministic finite state machine, Automata theory

Click to edit the document details