Theory of Computing

Table of contents

Title

FA Informal 1

FA Informal 2

FA Informal 3

FA Informal 4

FA Informal 5

FA Informal 6

FA Defn 1/3

FA Defn 2/3

FA Defn 3/3

DFA 1

Clamp FA 1

Clamp FA 2

Clamp FA 3

Clamp FA 4

HTML FA 1/2

HTML FA 2/2

DFA extended delta

DFA Language

NFA

NFA Definition

NFA Example

NFA extended delta

NFA Language

DFA = NFA

Subset construction

Ex Subset const

Theorem 2.11 & 2.12

Ex NFA 1

Ex NFA 2

Bad subset construct

Ex Text Search 1

Slide 33

Slide 34

String Matching Algorithms

Epsilon uses 1

Epsilon uses 3

Epsilon uses 2

Epsilon formal notation

Epsilon closures

Ex Epsilon closure

Epsilon extended delta & languages

Epsilon Language

Eliminating epsilon trans 1

Eliminating epsilon trans 2

Example DFA

Author: Dr. J

E-mail: Juliano@ecst.csuChico.edu

Homepage: http://www.ecst.csuchico.edu/~juliano

Further information:
Computer Science @ California State University, Chico