Top/RegularLanguages

Top | Top | recent changes | Preferences

Showing revision 1
Difference (from revision 1 to revision 1) (minor diff)
(The revisions are identical or unavailable.)

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 | View current revision
Edited September 23, 2004 4:06 pm by roam-neal2.cs.ucr.edu (diff)
Search: