CSE322

Minimization of finite Automaton &

REGULAR LANGUAGES

Lecture #5
Definitions
Properties
Construction of Minimum Automaton
Problem
• Construct a minimum state automaton
equivalent to finite automaton
Solution
Minimize the given automata
 Regular Languages
Definition: L
M
A language  
is regular ifLthere
 LisM
FA such that

Observation:
All languages accepted by FAs
form the family of regular languages

16
 Examples of regular languages:

abba  , ab, abba

awa : w  a, b* {a nb : n  0}
{ all strings with prefix }
ab
{ all strings without substring }
001

There exist automata that accept these

Languages (see previous slides).

17
 There exist languages which are not Regular:

n n
Example:
L {a b : n  0}

There is no FA that accepts such a language

(we will prove this later in the class)

18