Introducing Regular Expressions

# Category: Computation Theory

## Computation Theory: Syllabus

Syllabus for computation theory modules

## Computation Theory 5: Closure of Regular Operations

We prove the closure of regular operations on regular languages.

## Computation Theory 4: Equivalence of Determistic and Nondeterministic Finite Automata

Proving the equivalence of NFA’s and DFA’s

## Computation Theory 3: Nondeterministic and Deterministic

Covering deterministic and nondeterministic finite automa.

## Computation Theory: Module 2 Computation and Operations

Introduction: In the last module for computation theory we went over what a finite automaton is. We also learned two representations for them, the formal definition and… Read more “Computation Theory: Module 2 Computation and Operations”

## Computation Theory: Module 1 Finite Automata

Introduction: This is the start of the theoretical portion of reverse engineering. For this portion you will need to have a basic understanding of logical arguments and… Read more “Computation Theory: Module 1 Finite Automata”