You are on page 1of 17

MELJUN P.

CORTES, MBA,MPA,BSCS,ACS

CSC 3130: Automata theory and formal languages

Limitations of finite automata

Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc 3130

Many examples of regular languages
0 q0 1 0 0, 1 q0 1 q1 0 q2 1 q3 q1 1

((0 + 1)0 + (0 + 1)(0 + 1)(0 + 1))*

all strings not containing pattern 010 followed by 101

Is every language regular?

Which are regular?
L1 = {0n1m: n, m ≥ 0} L2 = {0n1n: n ≥ 0} L3 = {1n: n is divisible by 3} L4 = {1n: n is prime} L5 = {x: x has same number of 0s and 1s} L6 = {x: x has same number of patterns 01 and 10} Σ = {0, 1} Σ = {1} Σ = {0, 1}

Which are regular?
= 0*1*, so regular L1 = {0n1m: n, m ≥ 0} • How about: L2 = {0n1n: n ≥ 0} = {ε, 01, 0011, 000111, …} • Let’s try to design a DFA for it

… it appears that we need infinitely many states!

A non-regular language
• Theorem The language L2 = {0n1n: n ≥ 0} is not regular. • To prove this, we argue by contradiction:
– Suppose we have managed to construct a DFA M for L2 – We show something must be wrong with this DFA – In particular, M must accept some strings not in L2

A non-regular language
imaginary DFA for L2 with n states

x

M

• What happens when we run M on input x = 0n+11n+1?
– M better accept, because x ∈ L2

A non-regular language
0

x

M
0 0r1n+1

0

0

0

• What happens when we run M on input x = 0n+11n+1?
– M better accept, because x ∈ L2 – But since M has n states, it must revisit at least one of its states while reading 0n+1

Pigeonhole principle
Suppose you are tossing n + 1 balls into n bins. Then two balls end up in the same bin. • Here, balls are 0s, bins are states: If you have a DFA with n states and it reads n + 1 consecutive 0s, then it must end up in the same state twice.

A non-regular language
0

x

M
0 0r1n+1

0

0

0

• What happens when we run M on input x = 0n+11n+1?
– M better accept, because x ∈ L2 – But since M has n states, it must revisit at least one of its states while reading 0n+1 – But then the DFA must contain a loop with 0s

A non-regular language
0 0 0 0 0 0r1n+1

M

• The DFA will then also accept strings that go around the loop multiple times • But such strings have more 0s than 1s, so they are not in L2!

General method for showing nonregularity
• Every regular language L has a property:
z
an a1

… ak

ak+1

… an-1

an+1…am

• For every sufficiently long input z in L, there is a “middle part” in z that, even if repeated several times, keeps the input inside L

Pumping lemma for regular languages
• Theorem: For every regular language L There exists a number n such that for every string z in L, we can write z = u v w where  |uv| ≤ n  |v| ≥ 1  For every i ≥ 0, the string u vi w is in L.
z … u v … w

Proving non-regularity
• If L is regular, then: There exists n such that for every z in L, we can write z = u v w where |uv| ≤ n, |v| ≥ 1 and  For every i ≥ 0, the string u vi w is in L. • So to prove L is not regular, it is enough to show: For every n there exists z in L, such that for every way of writing z = u v w where |uv| ≤ n and |v| ≥ 1, the string u vi w is not in L for some i ≥ 0.

Proving non regularity
For every n there exists z in L, such that for every way of writing z = u v w where |uv| ≤ n and |v| ≥ 1, the string u vi w is not in L for some i ≥ 0. • This is a game between you and an imagined adversary
adversary you choose n 1 choose z ∈ L write z = uvw (|uv| ≤ n,|v| ≥ 1) choose i 2 you win if uviw ∉ L

Proving non-regularity
• You need to give a strategy that, regardless of what the adversary does, always wins you the game
adversary you choose n 1 choose z ∈ L write z = uvw (|uv| ≤ n,|v| ≥ 1) choose i 2 you win if uviw ∉ L

Example
adversary you choose n 1 choose z ∈ L write z = uvw (|uv| ≤ n,|v| ≥ 1) choose i 2 you win if uviw ∉ L

• L2 = {0n1n: n ≥ 0} 1}