Cs402 Theory of Automata

Meaning of Automata
It is the plural of automation and it means something that works automatically

Language and Type of Languages

Languages are defined in different ways such as descriptive definition, recursive
definition, using Regular expressions (RE) & Using Finite Automation (FA)
-Descriptive Definition: Language is defined, describing conditions imposed on its
words e.g., Language L of strings of odd length over ∑ = {a} as L= {a, aaa, aaaaa, …}
-EQUAL language consist of strings with number of a’s equal t number of b’s
-EVEN-EVEN language consists of strings with even No. of a’s & even No. of b’s
-INTEGR language consists of strings defined over ∑ = {-,0,1,2,3,4,5,6,7,8,9} is
written as INTEGER = {…,-2,-1,0,1,2,….}
-{a^nb^n} language consist of strings defined over ∑={a, b} as {a^n b^n : n=1,2,3,..}
-{a^nb^na^n} language consists of strings defined over ∑={a,b} as {a^nb^na^n:
n=1,2,3,….}
-Factorial Language consist of strings defined over ∑={1,2…9} i.e {1,2,6,24,120,…..}
-FACTORIAL language is defined over any single letter alphabet as {a^n! :n=1,2,3,
…}
-DOUBLEFACTORIAL language consists of strings defined over ∑={a,b} as{a^n!
b^n! : n=1,2,3,…}
-SQUARE language consists of strings defined over ∑={a} as {a^(n)^2 :n=1,2,3,..}
-DOUBLESQUARE language consists of strings defined over ∑={a,b} as { a^(n)^2
b^(n)^2 :n=1,2,3,..}
-PRIME language consists of strings defined over ∑ ={a} as {a^p : p is prime}
Two types of Languages
-Formal Languages (Syntactic Languages)
-Informal Languages (Semantic Languages)
An Important Language
-PALINDROME is a language consisting of ∧(null) and the strings s defined over ∑
such that Rev(s)=s
-There are as many as palindromes of length 2n as there are of length 2n-1
-There are as many as palindromes of length 2n as there are strings of length n
-There are .. many as palindromes of length 2n-1 as there are string of lengths n-1
- Number of strings of length ‘m’ defined over alphabet of ‘n’ letters is n^m

Alphabets
A finite non-empty set of symbols(letters) is called an alphabet. It is denoted by
sigma∑ (Greek Letter)
Example ∑ ={a,b} ∑={0,1}//important as this is the language which computer
understands

-A version of language ALGOL has 113 letters where ∑(alphabet) includes letters,
digits & a variety of operators such as GOTO & IF

Strings
Concatenation of finite symbols from the alphabet
-An Empty string or a string with no symbol also denoted with lambda λ is called a
null string and capital lambda ∧ will be mostly used to denote empty string
-Length of the string s is denoted by |s| and it is the No. of letters in t string
-The reverse of the string is denoted by Rev(s) or s’ and is obtained by writing
letters of s in reverse order e.g. if s is {a,b,c} then s’ will be {c,b,a}
Words
Words are strings belonging to some language
-All words are strings but not all strings are words

Valid/In-Valid Alphabets
-While defining an alphabet an alphabet may contain letters consisting of group of
symbols ∑1 = {B, aB, Bab, d}
-While defining an alphabet we should keep in mind that ambiguity should not
be created
-While defining an alphabet of letters which comprises of more then 1 symbol, no
letter should be started with the letter of the same alphabet, However a letter
maybe ender in the letter of the same alphabet