Chapter 1: Regular Languages

For Your Enjoyment

Chapter 1.3, Regular Expressions


The book requires GNFAs to have the following three properties:

A generalized nondeterministic finite automaton (GNFA) is a 5-tuple where

A GNFA accepts a string w in Σ* if w = w1...wk where each wi is in Σ* and a sequence of states q0...qk exists such that

DFA to Regular Expression Conversion Process

  1. Create an n+2 state GNFA from an n state DFA as follows:
  2. Repeatedly rip out one of the former DFA states using the following procedure until only the start state and accept state are left
  3. The regular expression equivalent appears on the transition from the start state to the accept state.

Lecture Problem

Active Learning Problem

Active Learning Problem

In-Class Notes

Valid XHTML 1.0!