Lecture 6: More with Regular Languages

Equivalence of F.A. and Regular Languages Claim: Every regular language is accepted by a F.A. (and hence by a DFA) Pf: Induct on the construction of regular expressions Base Case:

accepts { }

accepts

Inductive Step: If and are REs and L() and L( ) are accepted by FA (inductive hyp.), then so are:
L(( )) = L()L( ) L(( )) = L() L( ) L() = L()

(By the closure properties of the FA languages).

Lecture 6: More with Regular Languages

Claim: Every FA language is regular. Intuitive idea: transform loops into s

Proof method: Dene an extended NDFA to be like an NDFA but with edges labelled by regular expressions. E.g.
a e bab b

accepts (ababb) More formally, a transition can be followed while reading any string described by the RE.

Then: Given FA M , gradually transform it into an equivalent ENDFA M of the form

1 2 n 1

which accepts the regular language 1 . . . n