mple
ety
1
let - finite
nonemy
·
: -
-
-
-
elements
-Sing
:
letters/characters/syuifs
E
E
:
2
I
=
=
(a 3
, ..., z]
-E
*,
12)
10 1]
,
101
*
-
the
=
the
-
10011
:
2 I
z
-
3
=
0
:
=
=
59 33
.
a
111
-
1
it has
:
IE)
ladal
1 aa)
2
=
=
=
=
0
1
3
=
0
no
=
stricting
ana-s
let
a
o
(number
=
z
,
Ength of
(c)
(2)
:
2
Ga 54
-
or
empty string
E :
,
0011
,
strings
111
1
For
:
,
the set of all
-
finary ophabet
Finite sequence of letters from I
:
Cour z C
*
English alphobet
:
letters
=
39 3 ..., z)
,
,
So 13
,
activation
I
:
x
-
(xy|
=
(x) +
=
concatenation
.
#x
-
,
y
x
E
*,
X
y
is
:
a
:
=
=
good
Sye
unti
a
.
(y z)
·
*
not
generaley
seandy
of
omitted
xoy
=
xy
-
xe
=
ex
=
x
associative
z
concatenation
ab + 3
is
is
=
,
,
(y)
identity
(x y) z
.
yet
,
-fr
-
Sa B .., z]
(y)
z
+
I
RXT R
+:
*
x(yz))
identity
:
is 0
:
x+ o
=
Ofx = x
RXR-R
identity
is
1 : xx1
=
1*
x
=
-
sociative
+
T
z
g)
:
I
I
-
commutative
a
+z
(xy)xz
(x y)
-
*
-
z
=
=
=
(y z)
xx(ypz)
x+
x
-
+
y z)
-
C subtraction is not associative
+ z
x
*
x
-
-y
y yxz
y +y
-
-
x
-
reportion
+
no
=
=
ex :
a
=
Cab)
aga
=
abab
w
z
-
repeated
w
o
times
1
--
2
3--
-
ex
reverse
To the
nurse
=
Iw
0
=
(x11
:
:
of
wR
=
creat and sense
,
(x)*
=
xPuR
↓
-z
w =
=
w =
vR
-
(abb)
:
ua
,
=
I
-t
-
F
E
2
=
1
:
p
z:
2
=
#elements
I
are
W
letters
-ba
F D-elements
*
Eez"
E
-
not
nezaeZ
are
strings
1
a
a
string
,
letter
I Exa
auk
U
-
:
t
x
*
=
sui a
substring
pay
-sating/prefix/suffix
aba
:
~3 substringi
-
~
L
is a
E
-
s
is
re
is
substring of any
setrigify
a
a
abba--
x
string
U
iff
Ju veE
if
a
is
,
fi
-
,
abba
:
set
E
yefofy iff Zuez y and
27
proerprtixfy iff risapetic of y
=
a
a
and
substring ofy
is
i
ux
=
prefix
is
~
--
*
a y
,
substring off
proper
x
-
-
:
abba
prefixes fabba
-
:
suffices
:
E
,
:
2
,
9
,
ou
ab abb
,
,
abba
-
a
,
propor prefixes
ba 35a affa
,
,
suffixes
Troper
y
Language
a
-
setof strings
LE[
-
over
I
-
*
I
Ga letters
:=
3 aa ab, ba, 36, aaa ,
,
L
/1)
[* 55
=
9
,
,
,
cab
&
eZ-letter
a E
*
3
.
...
.
slrugs
-
Le
*
:
-notyL
L
=
=
2
*
223
(
+
92)
string
Integers
IN
-
countie
-
:
2:
0
1, 2
,
0
1 -1
,
,
,
Rational numbers
④
Irrational numbers
=
...
,
-
2
,
2
,
3,3 ....
I
uncountesh
ey dragonohzation
proof
-
countabl
assume
wa
-
-
5/ptX 2 to]
55 ---
nz
-
,
f
↓
-
3
3DR - Q
i
-
they
tret
cons
-
countable
are
a
itdecimal
number
:
fN
stdecimalof Mi
-
Edes. of N "Ide
.
of 12
-
39dec FN + 39des
.
fis
8
X
=
0
.
*
/ "
=> n , 42 43
X is not
among
-
-
-
-
his
↳
.
DFA
(Deterministic Finite Automaton)
,)
=
A
&
I
AEK
L transition
function
kxz-K
S
initial state
I start)
-start stal
O-final state
④
Peek , ae[
J(p c)
,
-
=
E -
aae((m)
%
-i get
L(+a )
*
=
Sa3
-E
↓
L()
Swe / + accepts +Y
*
=
127
~
Cd
%
&= letter
,
d
0
..
9
%
=
M
input
complete
-unfiguration
4)
initial
KXIP
:
config
computation
↑
↑
accepts
ects
o
or
:
:
0
..
9
~
(0 224)
E
+
,
-In
...
9/
(six)
(2 2)
,
*
iff
(s w)
+
iff
(S 4)
+
,
,
*
2EA
(2 2) ,
,
(2 2)
,
,
ccept
2 k
accept (reject)
(1 324) (1 24)
,
,
- (1 , 3)
CNC
finalstate
+ final
,
:
..
A Z
a
(S
I
+3
LItal
32 li accepts
=
d
z
..
↳ Inot
function
has to be
a
↓00
9 .. Z
& needed because
=>
:
input ab24
disa
digit
C
+
#
A)
(1 2)
,
↳
:0
done !
+
odd
even
⑰
*Dodd
⑧⑳
E
M
odd
13, 5 7 9
,
,
even
I
:
,
:
0
.
2
,
4 6 8
,
,
even
L(+a )
=
Sx/wodd]
>
-
241)
-
+
,
any language
:
-
Seedas")
every
B
a
imm
a
,
IFA
:
*G
.
+
O
has odd
*
I
even
odd
accepted by sorreD)
93
by
followed
b
10
parity
134)
,
accept
,
,
-
=
-
(0 41) + (0 1) + (2)
Regular language
E
final
3
.
L
Gueda 334/
,
ending in
no
(no
two consecutive characters
aa
or
one
the come]
bb)
3
↓
finishe
ja
0
-
0
so
e
b
b
3
D
⑧D
evn
as
odd
als
=
I missing
SveSa, 13
P
/ve does not antan all 4 letters 3
30
E G
↳
a
fo
ooo
oX
-
O
abedtlm
Sbed-hm
↑
g
O
-
number of state
grows
rapidity
Given
a
regular language
we
build
want to
,
a
DFA
for it.
*
LE2
x
↓ sou
G
x
Smo
·
y
u
-
&
ammonShira
2
-
-
ex
=
,
=
Swesas]
E
b
-
,
9
,
,
Ea
25
,
aa
*
/every
ob
add
a
Ba
,
,
,
:
x
7
,
z Sa 3)
z =
imm
b]
by
followed
a
.
33,
...
cab
ab
:
=
-
Both
-
-
Both
a taa
:
Lab L
old z
=
-
accepted
rejected
abeL
b
Ela
⑳
I
>
-
:
abet
aab1
Xa
z
EX
L
E
9
,
=
,
Sue sa e3
=
)
P
,
b
,
59 3)
na
,
,
ab
has
+
no
as
5
a
b)
, ...
at L
Ea
2b
z=
a
⑳
aaL
.
a
antl
as a
eX
=
L
=
Gaz Invol
-what are the
-
=
35
[21
,
IL am
,
[a] [ac3, [c] ,
,
add
z =
?
or
Z
=
all
-"
:
xz =
3b
-
addz
--
3
3
J
=>
,
equivatives classes of
infinitely many
a
nfm ,
,
ab aabb, accbbb ....
yz
=
abeL
cnL
different
>
=
abbeL
-
anabbL
--
z
,
m +Y
infinitely many
classes
Theorem
(1957)
#Nerode
L
has
En
finitely
regular
-
is
=>
E
"
Lis
#
regular
=>
JDFA
+
many
for L
L(va)
:
In has
closes than the states
more
⑳
Z
~
se
Z
y
,
L
or
"anstrict
-
(k
,
DFA
a
0 0
z
,
Lstates
,
↓
:
,
of 19 =>
:
must have
xz
for L
the some
.
yztL
yz(
A)
-E3/eL]
Lass
finitely many)
S kxz
z
=
,
v((2] a)
,
[x] #
:
nz ,
classes of En *
:
west,s
from two classes(y]
Shaviour
O
Fz
=
=
ofctols of it in # classes of En
if
M
classes
=
[xa]
My
=
↓
((x3 a)
& the
if
[xa]
=
x
,
,
*, atz
definition should not depend
[x]
=
Sy]
clim,a)
than
:
on
=
↓(sy] c)
nauyat
=
L
((23 4) (2)
#
,
w =
4
,
W2--*m
& &3 4)
↑
-
*
↓
#accepts
a
wez
hypen
*
,
WE
,
1993
=
,
must
"ja
[na]
12
-
,
17
↓
re
,
+
C90
,
,
02.m)
w wn)
ISS Yz
m)
...
,
(w--wmb
off [t]eA
=
,
<)
=
(Sus a)
Sisley
,
I
if
L
#
no
~
L
=
Sue [a 33P)w has
no
,
classes
*
:
as
o
553
EL
0 [] endiva el
]-nocawbb
aba
baba
39
① 29
or bb endling L
cob
bab
ch
]
② 23
-
,
...
,
-
,
,
,
,
-
,
,
,
aac
... ]
③ 100 bb,
na
no
,
..
-
-
face
an
wbb L
,
atales
A
↓-
eas
↳
②
(
⑧
&
3
I
98
⑬D
>
metiono,
anot
not
&
classes
:
of En
transit:
Esta
[S]
A [33
s 3[333
>
-
[a] E [ab]
153
- [3a]
Minimizing
steles
merge
-
P
DFA
given
a
=
2
whenever
iff
possible
wel
*
Supting
W
PigEK
(A)
an
Onenting
W
-
~
-
eq
niretent states
are merged
need to know E
limit of
Build =as
we
a
PEo2
↑
E
,
E
PE22
:
equivalences
:
En
strings we affing thi
:
pigeAw pigEA
:
behave the some after we letter
:
:
-
:
(1
Two letters (x1
:
=
=
1
2
(min)
DFA
for matching the
pattern
a
be abb
(matching)
·
-
NFA
↓
be
a
DFA
*
:
BC
a
&
a
A
b
⑧
a
,
a
↳
-
BC
#
Y
,
as
the some (mini
DFA
the
above
when
minimizing
Bas
(searching)
abe
NFA
,
*-
d
DFA
⑧
+
minimite
073070-07080
ZumpyLemma
-
= Sang/no]
R
-
does not have the
-
-
of these
property
-
assume
- show
Assume
must
:
-
= k
+
S
y
the
properly
E EweL
Zayte]
,
-
a
:
,
Iw1k
,
,
Ex
K-true
bu
-
-
w
no
=
ab
*
=
matter how
y +z
,
Inc
(x)
L
=
2k -k
,
sey, > are
nyzk(
chosen
T
xyz
w=
Enso-false
myzel
that
prove
xyz (xy/
<
,
I does not have
-
Inyl
pick
:
regular
is
-
,
prove Lisnot
prove
some
property
↳
[
Faye
-
w=
:
L has
,
one
-
property
=>
To
we
negation of property
-K
-
-
regular
L
,
with
w
=
ak-k
w =
xy
Z
(xy1
E
y
a
= k
=
K
x
Z
J
~
12yl
= k
P
x
=
a
=
a
z
2
y
xyz
,
=
a4
-
P
-
zzk
qx)
=
aP(2)
+
a
-P- 2y"
ay
+
=
z +x
k +(
=
-
a
for
n
=
2
-2z
-
1)2-k
: a 24tL
·
-
procf
:
-
-
-
Fr
LEREG
assume
ZweL
,
must
satisfy theproperty
satisfy theproperty
it doesn't
prove
=>
LEREG
=
-
Iwl > K
u
terms of
must be defined in
Lu
confessed
Trumping
prove
used
Lemma
:
to
-
Se
LEPE
I
can
#
E-7p
2
=
to
cannot
-
more
pomped ) pumping
be
LpV2
a
=
fanguage
a
language regular
is
Comme
qvTp
=
pumped
(annot
be
not regular
is
applies
to
L
LLqULp
>
=
LEREe)
Tumpug
Lemma
:
LerEx-(, )(f) ((ve(XI)
-
-
xyzc()
(E)
(
>
p)
prove =
↓
we
#( xyzmyly
=
-
(
)
(zi) (ft) ((we (X(uxx)
) v (74] z)(
7) (74) (fu) (7( Lam
-
-
....
>
+
(Fi) + (fx) ( . .
---
,
,
()
..
(vi) (zx) (we Ln(w > n - (54 3 z)( 1)
((k) (5x) (we (n(xk xn(x,y z)(2(v xyz a(xy1 xny + 2 A
cannot choose
+
D must consider
4)
I
(u)xyz
(
all
possibilitie
# ) (x) (veLn (n e) (Tw xyzV-Fause
72P
/
7 Iy/Ek V-FALSE
,
,
,
-
-
=
=
,
-
k
no
=
,
-
Pt
canog
t
us
us
of
[
xy
x =
1xy
y+
↳
Z
I = 12
Ty
E
[En)
xjzkL
+ 2V
,
-
FALSE
nyzeh)-TR
construction
recent
interactio
REDisclodunder
-
-
-
L
,
/EREG
build
-
DFA
a
:
DFAs
assume
stabs
are
pairs of
⑫
-
fina
off pis final in to
and
2
-
*
b
ja
⑪ as
-
-
T
93
even
states
iff
=
Li
(P 2)
.
LM2
1:
#2
:
0
0
:
·
:
↓
((i)
:
M2
Example
b
M , M2
length
2
be
Y
DFA
for 1
*
:
a
b(bb)
Emptiness problem for
REG
assume
LEREG
it
(cause
pumped
:
54, Fuel
v =
n =0
egth
:
1
0
2
... k
.
.
.
.
.
.
.
-
y
+ 2
i
If
I has
=>
:
lukik ,
L
if 1z1K then it
,
strings
,
W1YK
if Ly
,
115K
can
be
nyzeL Fu
,
,
xzcL
(xz( <
In
astring
to so
xyz
=
·
/
,
(xyz)
=
(4)
confpumped do
pumped
then I has alo
,
a
string
u,
lukk
it is sufficient to chea wel, w
K
#miness you h Fred
-
if then is
WeL ,
* Linfinite
↳
possible
=
must step
Setween
1
..
21
*
Lethestgee
,
jz
,
n30
-
W
Example- yupf
%
Da
*
L
=
aace
aaca
ababa-1
old-
↓
⑧- 300?
ength
pump
⑧
:
/baba)El
aab
93
↑
I
pup
D
W
th
n
pump y
:
=
=
2 aaabL
·
ca
↓-
P
⑧ pump
no
L
pump g
:
-
any repeated
act
:
-not
-
y baba
,
⑧
-
=
a
98
↳
odd ling
①
pump
state
=
:
working
a
libe
ab
gives a y
Se
that can
pumped
↳ gra
S
E+
E-
T
-
+x
feepeth
TlE T IT
F=
-
id
↑, *
-
-
-
and
Left-and right-associative
-
1-extrassociative
Risideonbegina
=
↑
associativity
-
Et
factor
F(T/F IF
(E) /
F-
e
associativityea
L
ExT[-left-hana associativity
--
E
:
-
-
T-TDFIT/F)
E- E
T
-
Radence
all
E
liftrecursive
E
le
must
higher
/
recedence tha
+,
-
evaluated first (rottom-up)
mustle closer to the Sottom
tool (in the
=> must Se
=>
generat
etr
E-EtTlE-T
T-TDF/T/F
-
-
used
grammer
first
und often
T
+
+
+
T
#
I
i
d
id
↓
I
have
=>
-
T
+
Tid
I
id
id + id + id + id
L
u
m
↑
this is the correct order of
evaluation
Sottom-up
↑