Theory of Computing

Table of contents

Title

RE Definition

RE operators 1/2

RE operators 2/2

Building REs

RE Operators 1

RE operators 2

FAs and REs 1/2

FAs and REs 2/2

Theorem 3.4 - 1

Theorem 3.4 - 2

Theorem 3.4 - 3

Theorem 3.4 - 4

Theorem 3.4 - Ex 1

Theorem 3.4 - Ex 2

Theorem 3.4 - Ex 3

Theorem 3.4 - Ex 4

DFA to RE 1

DFA to RE 2

DFA to RE 3

DFA to RE 3

DFA to RE 3

DFA->RE Ex 1

DFA->RE Ex 2

DFA->RE Ex 3

DFA->RE Ex 4

Theorem 3.7 - 1

Theorem 3.7 - 2

Theorem 3.7 - 2

Theorem 3.7 - 2

Theorem 3.7 - 3

Unix REs 1

Unix REs 2

Lexical Analysis

Finding Patterns

Associativity & Commutativity

Identities & Annihilators

Distributivity

Idempotence & Theorem 3.11

Review: Closure Defns

Closure Laws

Closure Laws

Closure Laws

Theorem 3.13 - 1

Theorem 3.13 - 1

Testing REs

Author: Dr. J

E-mail: Juliano@ecst.csuChico.edu

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

Further information:
Computer Science @ California State University, Chico