Pumping Lemma Examples L> = {aibj : i > j}
NS
Published · 67 slides · 0 views
1 / 1
Description
Pumping Lemma Examples L aibj : i j L is not regular. We prove it using the Pumping Lemma. L aibj : i j L is not regular. Fix an arbitrary pumping length n0. L aibj : i j L is not regular. Fix an arbitrary pumping
Related Topics
Share
Embed code
Download this presentation From Below
"Pumping Lemma Examples L> = {aibj : i > j}" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
01
Pumping LemmaExamples<br>
02
L> = {aibj : i > j} L> is not regular.
We prove it using the Pumping Lemma.<br>
We prove it using the Pumping Lemma.<br>
03
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.<br>
Fix an arbitrary pumping length n>0.<br>
04
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.<br>
05
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>. |s|≥ n<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>. |s|≥ n<br>
06
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>. aaa…aabb…b n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>. aaa…aabb…b n n+1<br>
07
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. aaa…aabb…b n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. aaa…aabb…b n n+1<br>
08
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b n n+1<br>
09
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b n n+1<br>
10
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b Y n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties. |xy|≤ n
|y|≥ 1 aaa…aabb…b Y n n+1<br>
11
L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n. aaa…aabb…b L> = {aibj : i > j} Y n n+1<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n. aaa…aabb…b L> = {aibj : i > j} Y n n+1<br>
12
aaabb…b n n+1-m L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n.
xz =an+1-mbn ∉ L>. L> = {aibj : i > j} n<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n.
xz =an+1-mbn ∉ L>. L> = {aibj : i > j} n<br>
13
L> = {aibj : i > j} L> is not regular.
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n.
xz =an+1-mbn ∉ L>.
So L> is not regular!<br>
Fix an arbitrary pumping length n>0.
Choose a proper string s in L>.
s = an+1bn ϵ L>.
Consider all possible splittings of s in x,y,z with the desired properties: y = am, 1 ≤ m ≤ n.
xz =an+1-mbn ∉ L>.
So L> is not regular!<br>
14
L={ww : w in {a,b}*} First, figure out what this language is.<br>
15
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language?<br>
A string in the language?<br>
16
First, figure out what this language is.
A string in the language? aabaab L={ww : w in {a,b}*}<br>
A string in the language? aabaab L={ww : w in {a,b}*}<br>
17
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language?<br>
A string in the language? aabaab
Another string in the language?<br>
18
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa<br>
A string in the language? aabaab
Another string in the language? aaaaaa<br>
19
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language?<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language?<br>
20
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb<br>
21
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language?<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language?<br>
22
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)<br>
23
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language?<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language?<br>
24
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!<br>
25
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!
Is a in the language?<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!
Is a in the language?<br>
26
L={ww : w in {a,b}*} First, figure out what this language is.
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!
Is a in the language? NO!<br>
A string in the language? aabaab
Another string in the language? aaaaaa
A string not in the language? abbb
Is ε in the language? YES! (ε = εε)
Is aa in the language? YES!
Is a in the language? NO!<br>
27
L={ww : w in {a,b}*} First, figure out what this language is.
L = {ε, aa, bb, aaaa, abab, baba, bbbb, aaaaaa …} abaabba|abaabba<br>
L = {ε, aa, bb, aaaa, abab, baba, bbbb, aaaaaa …} abaabba|abaabba<br>
28
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.<br>
29
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
First fix an arbitrary number n>0 to be the pumping length.<br>
First fix an arbitrary number n>0 to be the pumping length.<br>
30
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language<br>
Pumping length: n
Choose a proper string in the language<br>
31
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Choose wisely!!!<br>
Pumping length: n
Choose a proper string in the language. Choose wisely!!!<br>
32
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n aaa…aaa|aaa…aaa n n<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n aaa…aaa|aaa…aaa n n<br>
33
aaa…aaa|aaa…aaa L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 z y n n<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 z y n n<br>
34
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 aaaaa…aa|aaaa…aaa z y n+1 n+1 y ϵ L<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 aaaaa…aa|aaaa…aaa z y n+1 n+1 y ϵ L<br>
35
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 aaaaaaa…a|aaaaa…aaa z y n+2 n+2 y ϵ L y<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 aaaaaaa…a|aaaaa…aaa z y n+2 n+2 y ϵ L y<br>
36
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 a…aaaa|aa…aaa z n-1 n-1 ϵ L<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2 a…aaaa|aa…aaa z n-1 n-1 ϵ L<br>
37
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2, there is no i: xyiz ∉ L!<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2, there is no i: xyiz ∉ L!<br>
38
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2, there is no i: xyiz ∉ L!
s = a2n doesn’t work!!!<br>
Pumping length: n
Choose a proper string in the language. Example: For s = a2n
For x = ε, y = a2, z = a2n-2, there is no i: xyiz ∉ L!
s = a2n doesn’t work!!!<br>
39
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n abab…abab|abab…abab n n<br>
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n abab…abab|abab…abab n n<br>
40
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2 abab…abab|abab…abab n n z y<br>
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2 abab…abab|abab…abab n n z y<br>
41
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2 abababab…ab|ababab…abab n+1 n+1 y z y ϵ L<br>
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2 abababab…ab|ababab…abab n+1 n+1 y z y ϵ L<br>
42
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2
For any i, xyiz = (ab)2i(ab)2n-2 = (ab)2(i-n-2) ϵ L!<br>
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2
For any i, xyiz = (ab)2i(ab)2n-2 = (ab)2(i-n-2) ϵ L!<br>
43
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2
For any i, xyiz = (ab)2i(ab)2n-2 = (ab)2(i-n-2) ϵ L!
s = (ab)2n doesn’t work!<br>
Pumping length: n
Choose a proper string in the language. Example: For s = (ab)2n
For x = ε, y = abab, z = (ab)2n-2
For any i, xyiz = (ab)2i(ab)2n-2 = (ab)2(i-n-2) ϵ L!
s = (ab)2n doesn’t work!<br>
44
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language.
Use s = anbanb aaaa…aab|aaaa...aab n n<br>
Pumping length: n
Choose a proper string in the language.
Use s = anbanb aaaa…aab|aaaa...aab n n<br>
45
aaaa…aab|aaaa...aab We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language.
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: L={ww : w in {a,b}*} y n n<br>
Pumping length: n
Choose a proper string in the language.
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: L={ww : w in {a,b}*} y n n<br>
46
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: y = am with 1 ≤ m ≤ n.<br>
Pumping length: n
Choose a proper string in the language
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: y = am with 1 ≤ m ≤ n.<br>
47
L={ww : w in {a,b}*} We prove that L is not regular by using the pumping lemma.
Pumping length: n
Choose a proper string in the language
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: y = am with 1 ≤ m ≤ n.
Observe that xy2z = am+nbanb is not in L
QED<br>
Pumping length: n
Choose a proper string in the language
Use s = anbanb
For any splitting of s in x,y,z with the desired properties: y = am with 1 ≤ m ≤ n.
Observe that xy2z = am+nbanb is not in L
QED<br>
48
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?<br>
49
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
A first attempt to design a FA q10 q11 q12 q13 q2n a,b q2n-1 q2n-2 q2n-3 q1n q20 a,b a,b a,b a,b a,b a,b a,b ε ... ...<br>
A first attempt to design a FA q10 q11 q12 q13 q2n a,b q2n-1 q2n-2 q2n-3 q1n q20 a,b a,b a,b a,b a,b a,b a,b ε ... ...<br>
50
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
A first attempt to design a FA fails! q10 q11 q12 q13 q2n a,b q2n-1 q2n-2 q2n-3 q1n q20 a,b a,b a,b a,b a,b a,b a,b ε ... ... Works for string
sizes up to n!<br>
A first attempt to design a FA fails! q10 q11 q12 q13 q2n a,b q2n-1 q2n-2 q2n-3 q1n q20 a,b a,b a,b a,b a,b a,b a,b ε ... ... Works for string
sizes up to n!<br>
51
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.<br>
Looks similar with L (L = {w1w2 : w1 = w2}.<br>
52
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!<br>
53
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.<br>
54
Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’, L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} abbba…abb|bbaba…aaa n n 2n≥2<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’, L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} abbba…abb|bbaba…aaa n n 2n≥2<br>
55
abbba…abb|bbaba…aaa L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x, y, z with the desired properties. z y n n |y|≥1 and |xy|≤ 2<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x, y, z with the desired properties. z y n n |y|≥1 and |xy|≤ 2<br>
56
abbba…abb|bbaba…aaa L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest. z y n n<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest. z y n n<br>
57
ababbba…ab|bbbaba…aaa L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy2z in L’. n+1 ϵ L’ z y y n+1<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy2z in L’. n+1 ϵ L’ z y y n+1<br>
58
abababbba…a|bbbbaba…aaa L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy3z in L’. n+2 ϵ L’ z y y y n+2<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length k=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy3z in L’. n+2 ϵ L’ z y y y n+2<br>
59
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length n=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy0z in L’. bba…abbb|baba…aaa ϵ L’ z n-1 n-1<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length n=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
xy0z in L’. bba…abbb|baba…aaa ϵ L’ z n-1 n-1<br>
60
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length n=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
For every i ≥ 0, xyiz in L’.<br>
Looks similar with L (L = {w1w2 : w1 = w2}.
But the pumping lemma holds!
Fix pumping length n=2.
For every proper string s in L’,
split s in x = ε ,y = first two symbols of s, z = rest.
For every i ≥ 0, xyiz in L’.<br>
61
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}.<br>
Consider L’’ = {w : w has even length}.<br>
62
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}.
Every string of even length abbbaabb….…bbabaaaa 2n<br>
Consider L’’ = {w : w has even length}.
Every string of even length abbbaabb….…bbabaaaa 2n<br>
63
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}.
Every string of even length
can be split into two parts of equal length abbbaabb… …bbabaaaa n | n<br>
Consider L’’ = {w : w has even length}.
Every string of even length
can be split into two parts of equal length abbbaabb… …bbabaaaa n | n<br>
64
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}.
Every string of even length
can be split into two parts of equal length
and vice versa. abbbaabb….…bbabaaaa 2n<br>
Consider L’’ = {w : w has even length}.
Every string of even length
can be split into two parts of equal length
and vice versa. abbbaabb….…bbabaaaa 2n<br>
65
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}.
L’ = L’’
Every string of even length
can be split into two parts of equal length
and vice versa.<br>
Consider L’’ = {w : w has even length}.
L’ = L’’
Every string of even length
can be split into two parts of equal length
and vice versa.<br>
66
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
Consider L’’ = {w : w has even length}
L’ = L’’
A DFA for L’’: odd a,b even a,b<br>
Consider L’’ = {w : w has even length}
L’ = L’’
A DFA for L’’: odd a,b even a,b<br>
67
L’ = {w1w2 : w1,w2 ϵ {a,b}*,|w1|=|w2|} Is it regular?
YES!!!
L’ = L’’
A DFA for L’: odd a,b a,b even<br>
YES!!!
L’ = L’’
A DFA for L’: odd a,b a,b even<br>