Theory of Computation, CSCI 438, Fall 2013
Review for Final Exam
Regular Languages
Know the definition of a DFA.
Be able to convert:
Conversion
Definition
Picture M= (), i.e. the formal
definition
M= () Picture
Using What
Be able to convert:
Problem solvi
Theory of Computation, CSCI 438, Fall 2013
Review for 2nd Midterm
Regular Languages
Know the definition of a DFA.
Be able to convert:
Conversion
Definition
Picture M= (), i.e. the formal
definition
M= () Picture
Using What
Be able to convert:
Problem solv
Homework #6
Due Sept. 18 (Wednesday)
Precisely describe a process for taking any NFA and converting it to a DFA.
Exercises 1.11 and 1.16
Given any NFA M = (Q, , ,q0,F), M can be converted to a DFA as follows:
Since Q is a set, the power set of Q will cons
Theory of Computation, CSCI 438, Fall 2013
Review for Midterm 1, Oct. 9
Regular Languages
Know the definition of a DFA.
Be able to convert:
Conversion
Definition
Picture M= (), i.e. the formal
definition
M= () Picture
Using What
Be able to convert:
Proble