Professional Documents
Culture Documents
• Understanding of system
• Understanding of machine
• How it work systematically
• Alphabets
1. A set of letters, denoted by sigma Σ
2. Σ = {a,b}
• String
1. Concatenation of letters
2. Sequence
3. Aa, bb, ab, ba
• Language
• A set of string with rules
• Rule of every language
• E.g.
• Make a language for machine which strings starts with ‘a’ and
end with ‘a’ from alphabet {a,b}
Strings from {a,b}
1. Concatenation of letters
• aa
• Bb
• Abbbba
• Baaabbbbaaaa
• aabbbaab
• Abaaaabbaa
• Baa…
Make a language for machine which strings starts with
‘a’ and end with ‘a’ from alphabet {a,b}
• Aa
• ab
• abba
• Ba
• aaba
• aba
1. L1 ={aa,aba, abba, aaba…} this is language with rule
2. L2 ={aneela, aqsa, allama, asia, akifa…}
String vs word
• aa
• Bb
• Aba
• abbbbbbbbba
• Abbbbbbbaaabbbaaab
• Ababaab
• aaaaaab
These are string
• But word is aa,aba
1. Because it is permissible in language
2. L1 ={aa,aba, abbbbbbbbba…}
Properties of string
• Empty string
• Length of string
• Reverse of string
• Power of alphabet
• Power of string
• Σ = {a,b} alphabet denoted by Σ
• where m is length/power
Power of string
• Determine the length of string
• {bab}2 babbab
• ba2b = baab
Consider the language S*
• Where S={a,b}
• Lexicography order
Power of alphabet
• Determines that the string made from
alphabet will be of length equal to power of
alphabet.
• Σ = {a,b}2 or Σ 2 = {aa ab ba bb}
• Σ 2 = {aa ab ba bb}
Power of string
• Determine the length of string
• {baba}2 = baba baba
• ba2b = baab
• Denoted by *
So what is kleene star ?
• Σ 2 = {aa ab ba bb}
– B = 12321
– Reverse(B) = 12321
Palindrome = {^,all string A such that reverse(A)}
E.g.
Palindrome ={a, b, aa, bb, aaa, aba…}
• Descriptive definition is a method by which we
define language.
• Can Describe condition imposed on language
• languageName = {definition}
Recursive Definition
• What is recursive definition ?
• How to use this ?
• Will Understand with example
– Positive even numbers
– palindrome
Automata input
• How automata know to accept or reject
input ?
– It based on rules and language
– Language is must for every machine
– Rules is important
– Accept or reject input based on rules
• RE = a*
• RE = a+
Example(Concatenation)
• Example:
• String start with a and contain any b letters
• L={a,ab,abb,abbb…}
• RE = ?????????
• ab (concatenation)
• We just learned how to define language with
the help of string.
• Example:
• String contains a or b only
• L = {a,b}
• RE = a + b (union of string) OR