Professional Documents
Culture Documents
1 Introduction Toc
1 Introduction Toc
• Languages
– Which operations ?
• The simpler, the better.
• Basis of
– Algorithm analysis – Can you make your
– Complexity theory program more efficient?
• Analysis of • Compilers
algorithms • Circuit design
• Complexity Theory
• Cryptography
• Example
– automatacomputation = automatacomputation
Example:
Let Σ = {0, 1} be the alphabet.
Le = {Σ* | the number of 1’s in is even}.
Le= {Σ* | the number of 1’s in is not even}.
Le= {Σ* | the number of 1’s in is odd}.
Example:
L = {Σ* | the number of 1’s in is even}
L+ = {Σ* | the number of 1’s in is even} = Le*
Why?
L* = L+ {ε} ?
Beware
A language is a set.
1 1
01 10
001 100
0001 1000
00001 10000
L1 L2
Jaruloj Chongstitvatana 2301379 Chapter 1 Introduction 35
And, there is also a set of languages.
A class of language
1 1
01 10
L1
001 L2
100
0001 1000
00001 10000
L1 L2
Jaruloj Chongstitvatana 2301379 Chapter 1 Introduction 36