Top/RegularLanguages

Top | Top | recent changes | Preferences

Difference (from prior minor revision) (no other diffs)

Removed: 1d0


Changed: 23c22
* Transition function δ : S × Σ → S
* Transition function δ : S × Σ → S (See Chapter 0 of /Sipser for mathematical notation.)

Changed: 32c31
* Chapter 1 in /Sipser .
* Chapter 1 in /Sipser .

Regular languages

Read /TheGeneralIdea before reading this.

Regular languages are languages that can be decided by finite automata -- computers with a finite number of states.

What is a finite automaton? In class we drew examples using diagrams (graphs where the nodes are states and edges are transitions).

Examples of regular languages:

Formally, how to define a finite automaton?

[Did not formally define how a finite automaton computes.]

Examples of non-regular languages:


References


Top | Top | recent changes | Preferences
This page is read-only | View other revisions
Last edited September 23, 2004 4:20 pm by roam-neal2.cs.ucr.edu (diff)
Search: