Theory of Computer Science

MODULE-1
Alphabet

A finite set of symbols is denoted by ∑.

Language

A language is defined as a set of strings of symbols over an alphabet.

Language of a Machine

Set of all accepted strings of a machine is called language of a machine.

Grammar

Grammar is the set of rules that generates language.

CHOMSKY HIERARCHY OF LANGUAGES

Type 0-Language:-Unrestricted Language, Accepter:-Turing Machine, Generetor:-Unrestricted

Grammar

Type 1- Language:-Context Sensitive Language, Accepter:- Linear Bounded Automata,

Generetor:-Context Sensitive Grammar

Type 2- Language:-Context Free Language, Accepter:-Push Down Automata, Generetor:-

Context Free Grammar

Type 3- Language:-Regular Language, Accepter:- Finite Automata, Generetor:-Regular

Grammar

Finite Automata
Finite Automata is generally of two types :(i)Deterministic Finite Automata (DFA)(ii)Non Deterministic
Finite Automata(NFA)

DFA

DFA is represented formally by a 5-tuple (Q,Σ,δ,q0,F), where:

 Q is a finite set of states.

 Σ is a finite set of symbols, called the alphabet of the automaton.
 δ is the transition function, that is, δ: Q × Σ → Q.
 q0 is the start state, that is, the state of the automaton before any input has been processed,
where q0 Q.
 F is a set of states of Q (i.e. F  Q) called accept states or Final States
1. Construct a DFA that accepts set of all strings over ∑={0,1}, ending with 00 ?

1
0
A B
S State/Input 0 1
1
A B A
0 B C A
1 *
C C A
C 0

2. Construct a DFA that accepts set of all strings over ∑={0,1}, not containing 101 as a substring ?

0 1
1
A B State/Input 0 1
S *A A B
0
0 *B C B
0,1
*C A R
C R R R R
1
NFA

NFA is represented formally by a 5-tuple (Q,Σ,δ,q0,F), where:

 Q is a finite set of states.

 Σ is a finite set of symbols, called the alphabet of the automaton.
 δ is the transition function, that is, δ: Q × Σ → 2Q.
  q0 is the start state, that is, the state of the automaton before any input has been processed,
where q0 Q.
 F is a set of states of Q (i.e. F  Q) called accept states or Final States

1. Construct a NFA that accepts set of all strings over ∑={0,1}, ending with 00 ?

State/Input 0 1
0,1
A A,B A
A C B C _
B
S 0 0 *C _ _

2. Construct a NFA that accepts set of all strings over ∑={0,1}, containing 10 as substring ?

0,1 0,1
State/Input 0 1
A C A A A,B
B
S 1 0 B C _
*C C C

NFA to DFA conversion

Every DFA is an NFA, it is clear that the class of languages accepted by NFA’s includes the
languages accepted by DFA’s.

To convert NFA to DFA we can carry out the following algorithm:

1- begin with {q0}, start state, and calculate ({q0},a) for all a in  this gives a number of new states
Q-.

2- For each new states Q-, we again calculate (Q-,a) for all a in  and introduce new states if
necessary.

3- Repeat step2 until there are no new states.

4- Final states of new DFA are the states that contain any final state of the previous NFA.
 NFA State Transition Diagram

1,0

A B C
S 1 0

State Transition Table of DFA

State/Input 0 1
A A [A,B](New)
[A,B] [A,C](New) [A,B]
* [A,C] A [A,B]

0
1 1
A A,B
S
0
0 1

A,C
C
Construct a DFA that accepts set of all strings over ∑={0,1}, not containing 11 as substring ?

1. Construct a NFA containing 11 as a substring say N.

2. Covert N to equivalent DFA say D.
3. Construct ID by converting the nonfinal states to final states and final states to nonfinal states in
D.

0,1 0,1

A B C
S 1 1
State Transition Table of DFA containing 11 as substring.

State/Input 0 1
A A [A,B](New)
[A,B] A [A,B,C](New)
* [A,B,C] [A,C](New) [A,B,C]
*[A,C] [A,C] [A,B,C]

State Transition Table of DFA not containing 11 as substring.

State/Input 0 1
*A A [A,B](New)
* [A,B] A [A,B,C](New)
[A,B,C] [A,C](New) [A,B,C]
[A,C] [A,C] [A,B,C]

0 1

A A,B
S
0
1
0 0
A,C A,B,C 1

1
Conversion of FA with є-moves to NFA with out є-moves

1. Convert the given FA with є-moves to NFA.

0 1 2
є є
A B C
S
 Find є* (Epsilon Closure) of all states

є*(A)={A,B,C}

є*(B)={B,C}

є*(C)={C}

Pre and Post є* treatment

Find δ(A,0)

є*(A)={A,B,C}

Input(є*(A),0)={A}

є*( Input(є*(A),0))={A,B,C}

Like that δ(A,1)={B,C}, δ(A,2)={C}, δ(B,0)={}, δ(B,1)={A,B}, δ(B,2)={C}, δ(C,0)={}, δ(C,1)= {},
δ(C,2)={C}.

State Transition Table of NFA with out є-moves

State/Input 0 1 2
*A A,B,C B,C C
*B _ B,C C
*C _ _ C

0 1
0,1

A B
S
1,2
0,1,2

2
C

CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT TO A REGULAR EXPRESSION

1. Decompose the regular expression into parts.

 2. Construct the parts and then combine different parts using є transitions.

3. Remove unnecessary є transitions.

Q. Construct FA for the RE=(0+1)*(00+11)(0+1)* .

(0+1)*(00+11)(0+1)*
A B

(00+11)
(0+1)* (0+1)*
A C D
B

0,1
0 0
0,1 F
є
є
є є
A E C D I B

1 G
1

0,1
0 0
C
0,1

B
A

1
D 1
CLOSURE PROPERTY OF REGULAR SET

The closure property of a set signifies the containment of the elements of the set under a particular
operation is in the same set. So it defines the set of operations on the regular set that results to an element
of regular set.

 If L1 is regular and L2 is regular then L1UL2 ,L1L2 and L1∩L2 are also regular.

 The class of regular sets is closed under substitution.

 The class of regular sets is closed under kleene closure .

 The class of regular set is closed under homomorphism and inverse homomorphism.

 The class of regular sets is closed under complementation.

Regular Expression from FA

0 1 0,1

A B C
S 1 0

Reachability Equations for each State

A=є+A0-------------------(1)

B=A1+B1---------------------(2)

C=B0+C(0+1)-----------------(3)

Solving (1) by Arden’s Lemma

A= є0*=0*-------------------(4)

Put (4) in (2)

B=0*1+B1------------------(5)

Solving (5) by Arden’s Lemma

B=0*11*=0*1+--------------(6)

Regular Expression is A+B=0*( є+1*)=0*1*

 0

A B
S 1
1 0
0

C 0,1
D
1

A=є+B1+D0--------------(1)

B=A0---------------------(2)

C=B0+D1+C(0+1)-------------(3)

D=A1------------------(4)

Put (2) and (4) in (1)

A= є+A01+A10

= є+A(01+10)

= є(01+10)*

=(01+10)*

So the Regular Expression is (01+10)*.

IDENTITIES FOR REGULAR EXPRESSIONS

Φ+R=R

ΦR=RΦ= Φ

єR=Rє=R

є*=є

φ*=є

R+R=R

R*R*=R*

RR*=R*R
(R*)*=R*

Є+RR*=R*=є+R*R

(PQ)*P=P(QP)*

(P+Q)*=(P*Q*)*=(P*+Q*)*

(P+Q)R=PR+QR

R(P+Q)=RP+RQ

Q. Prove (1+00*1)+(1+00*1)(0+10*1)*(0+10*1)=0*1(0+10*1)*

LHS=(1+00*1)+(1+00*1)(0+10*1)*(0+10*1)

=(1+00*1)(є+(0+10*1)*(0+10*1))

=(1+00*1)(0+10*1)*

=(є+00*)1(0+10*1)*

=0*1(0+10*1)*=RHS.

Regular Grammar

Right Linear Grammar and Left Linear Grammar From FA

Find RLG and LLG from the given FA.

0,1

A B C
S 0 0

RLG

A0A|0B|1A

B0C|0

Updating RLG

A0A|0B|1A

B0
Constructing LLG

1. Construct the reverse machine of the Given FA(Covert initial state to final state and vice versa).
2. Find RLG.
3. Reverse the position of Nonterminal and terminal at the RHS of the productions.

0,1

A B C
0 0 S

C0B

B0A|0

A0A|1A|0|1

LLG

CB0

BA0|0

AA0|A1|0|1

MINIMIZATION OF FA

It is desirable to reduce the number of states as far as possible because it requires less space and is easily
processed. Here we are using partitioning method for minimization.

Partitioning Method.

1. At first states are divided into final states and non-final states.

2. Then inputs are applied on the states.

3. Again the groups are converted into groups by looking at their transition to same group
of different group. If two states are transiting to same groups by the same input then they are
kept in same group or separate groups.

State Minimization of FA
0
A B
S
0
1 1

C D
 State/Input 0 1
A B *C
B A *D
*C *E F
*D *E F
*E *E F
F F F

By Partitioning Algorithm

{[A, B, F],*[C, D, E]}

{[A, B], [F],*[C, D, E]}

0 0, 1

[A, B] [F]
S
1
1

[C,D,E]

PUMPING LEMMA FOR REGULAR SET

If L is a Regular Language accepted by some finite automaton D with n number of state, with a string w
in L written as w=xyz,then

a. |y|≥1

b. |xy|≤n

c. xyiz є L,for all i≥0.

To prove a language as non regular we have to find out a I value such that condition (c) is not satisfied.

Non regular Languages

{a2n|n≥1} is not regular.

{ap|P is a prime} is not regular.

{anbn|n≥0} is not regular.

Q. Show that L={ap|P is a prime} is not regular.

Solution:

L={a2,a3,a5……..}. let us consider w=aaa.

Let us consider X=a, y=a,z=a

Let us consider i=2

So xyiz=aaaa doesn’t belong to L.

Hence L={ap|P is a prime} is not regular.

 MODULE-2
Generally the context free languages are used for parser design. Also useful in deriving the block
structure in programming languages. Context free language is generated by context free grammar and
accepted by Push down automata.

Context Free Grammar

A CFG denoted G(V,T,P,S) where V is a finite set of nonterminals,T is a finite set of terminals,P is the
finite set of production rules and S is a starting symbol.

Here production rule is of Aα form where AєV,αє(VUT)*.

Q. Construct a CFG to generate set of palindromes over alphabet {a,b}.

Ans. SaSa

SbSb

Sє|a|b

Derivation Tree(Parse Tree)

Deviation Tree is a tree representation of derivation steps required to derive a string from the starting
symbol S of the CFG G.

Q. Derive aabaa from the grammar G({S,A},{a,b},P,S),where P consists of SaAS/a/SS,ASbA/ba

.
S
S

a a S
A

b a a
The step wise derivation shown in the above tree.

SSS

aaAS

aabaS

aabaa

LEFT MOST DERIVATION(LMD) AND RIGHT MOST DERIVATION(RMD)

If at each step in a derivation a production is applied to the left most nonterminal, then the derivation is
called LMD, if it is applied to right most nonterminal then the derivation is called RMD.

Q. Derive abaa from the grammar G({S,A},{a,b},P,S),where P consists of SaAS/a/SS,ASbA/ba/b

LMD

SaAS

abaS

abaa

RMD

SSS

Sa

aASa

aAaa

abaa

AMIGUOUS GRAMMAR

A CFG G is called ambiguous iff there exist some words wєL(G), that can be expressed by more than one
parse tree. Also there exist more than one LMD or RMD.

Q. Show that the CFG G({S},{a,b,+,*},P,S)where p consists of SS+S|S*S|a|b.

Let us consider a word a+a*b.

Two LMDs

SS+Sa+Sa+S*Sa+a*Sa+a*b

SS*SS+S*Sa+S*Sa+a*Sa+a*b

SIMPLIFICATION OF CFG

A CFG G can be simplified by eliminating not useful symbols from G. This can be achieved by
eliminating useless symbols, Null productions and unit productions.

Eliminating useless symbols

Consider a grammar G having productions

SAB/a

Aa

Here SAB is useless so remove it.

So the Simplified Grammar is

Sa

Aa

Eliminating Null production

Consider a grammar G having productions

SaS|bA,AaA|є

Aє is a null production after removing it the Simplified Grammar is

SaS|bA|b,AaA|a

Eliminating Unit Production

A production of the form AB ,where A,B єV is called unit production.

Consider a grammar G having productions

SA|bb

AB|b

BS|a

After Eliminating unit productions SA,AB,BS the simplified Grammar is

Sb|a|bb

Aa|bb|b

Bbb|b|a

NORMAL FORMS

According to context free grammar the right hand side of the production can be any combination of
terminals and nonterminals. The Normal Forms are used to restrict the right hand side of a production
rule.

Two widely used normal forms are

1) Chomsky Normal Form(CNF)

2) Greibach Normal Form(GNF)

Chomsky Normal Form

A context free grammar G is inCNF if all the production obey the form ABC or Aa.

Greibach Normal Form

A context free grammar G is inCNF if all the production obey the form Aaα , where αє(V)*.

Q. Find the equivalent grammar in CNF for the grammar G=({S,A,B,D},{a,b},P,S)

Productions are SaAD,AaB|bAB,Bb,Dd.

SXM

Xa

MAD

AXB

AYN

Yb

NAB

Bb

Dd

Model of pushdown automata

PDA is defined as 7-tuple notation.

M(Q,∑,┌,δ,q0,z0,F)

Q=Finite set of states

∑=Finite set of input alphabet

┌=Finite set of stack alphabet

δ =Qx{∑U{є}}x┌Qx┌*

Deterministic Push Down Automata

A PDA is said to be deterministic if all derivations(ID) in the design has to give only single move.

NonDeterministic Push Down Automata

A PDA is said to be nondeterministic ,if derivation generates more than one move in the designing of
particular task.

Q.Construct PDA that accepts L={anbn|n>0}

Instantaneous Description

(q0aaabbb,Z0)|-------- (q0aabbb,xZ0)|----------(q0abbb,xxZ0)|---------( q0bbb,xxxZ0 )|-----------

(q1bbb,xxxZ0)|---------- (q1bb,xxZ0)|--------( q1b,xZ0)|------ ( q1,Z0) |---------- (qf,___)

a,Z0|xZ0
b,x|є

q0 q1
S b,x|є

є,Z0|є
a,x|xx

q2
 State Transition Table

a b є
x Z0 x Z0 x Z0
q0 (q0,xx) (q0,xZ0) (q1,є) _______ ________ _______
q1 _________ _______ (q1,є) _______ ________ (qf ,__)
q2 _________ _______ _________ _______ _________ ________

NonDeterministic Push Down Automata

Q. Construction of NPDA for L={wwR|wє(a+b)+}

a,Z0|xZ0/ a,x|xx/ a,y|xy a,x|є/ b,y|є

a,x|є

q0 q1
S
b,y|є

b,Z0|yZ0/ b,x|yx/ b,y|yy є,Z0|є

qf
Cocke,Younger & Kasami Algorithm

This algorithm is useful for testing membership in a CFL(Context Free Language). This is based on the
idea of Dynamic programming. The CFG should be in CNF. The table is filled row-by-row in bottom to
top. The bottom row correspond to the substring of length 1. The second row from bottom row
corresponds to the substring of length 2, like on. It takes O(n) time to compute any one entry of the table
and here n(n+1)/2 entries are there so T.C. is O(n3) .

X15
X14 X25
X13 X24 X35
X12 X23 X34 X45
X11 X22 X33 X44 X55
a1 a2 a3 a4 a5

In this above figure the word of length 5 say a1a2 a3 a4 a5 is tested for its membership under a CFG say G.
If we find the starting symbol of the CFG in X15 then we can say a1a2 a3 a4 a5 is a member of L(G).

Q. Given CNF grammar

SAB|BC

ABA|a

BCC|b

CAB|a

Test that the string baaba is in L(G).

Ans:- Dynamic Programming formulation for CYK

Xij=Ui≤k<j XikXk+1j

First row from the bottom

X11={B}, X22={A,C}, X33={A,C}, X44={B},X55={A,C}

Second row from the bottom

X12=X11X22={B}{A,C}={BA,BC}={A,S}

X23=X22X33={A,C}{A,C}={AA,AC,CA,CC}={B}
X34=X33X44={A,C}{B}={AB,CB}={S,C}

X45=X44X55={B}{A,C}={BA,BC}={A,S}

Third row from the bottom

X13=X11X23 U X12X33={B}{B} U{S,A}{A,C}

={BB,SA,SC,AA,AC}={}

X24=X22X34UX23X44

={A,C}{S,C}U{B}{B}

={AS,AC,CS,CC,BB}

={B}

X35=X33X45UX34X55

={A,C}(A,S)U{S,C}{A,C}

={AA,AS,CA,CS,SA,SC,CA,CC}

={B}

Fourth row from the bottom

X14=X11X24UX12X34UX13X44

={B}{B}U{A,C}{S,C}U{}{B}

={BB,AS,AC,CS,CC,B}

={}

X25=X22X35 UX23X45UX24X55

={A,C}{B}U{B}{S,A}U{B}{A,C}

={AB,CB,BS,BA,BA,BC}

={S,A,C}

Last row from bottom

X15=X11X25UX12X35UX13X45UX14X55

={B}{S,A,C}U{S,A}{B}U{}{S,A}U{}{A,C}

={BS,BA,BC,SB,AB,S,A,C}

={A,S,C}
{S,A,C}
--------- {S,A,C}
--------- {B} {B}
{S,A} {B} {S,C} {S,A}
{B} {A,C} {A,C} {B}
{A,C}
b a a b a

So baaba is a member of L(G).

Parikh’s Theorem

To understand Parikh’s Theorem there is a need of some basic definitions of Linear subset, Semilinear
subset and Parikh’s Mapping.

Linear subset: A linear subset M, of Nn is given by tuples t0,t1,……,tm є Nn, where m єN and n єN+.

M={t0+l1t1+….+lmtm|l1,l2,…..,lm є N }

=t0+{t1,…..tm}*

Semilinear subset: A semilinear subset,M΄, of Nn, is a union of finite number of linear subsets M1,…..Mk,
where k єN+.

Parikh Mapping: if a word w is defined over ∑={a1,a2,…..,an}, where n єN+ , Parikh image is

Ψ(w)={m1,m2,…..mn}. Each mi represents the occurrences of ai in w.

Example:- Suppose language L is defined by ∑={a,b}. words are w1=abab, w2=babb,w3=aaa,then

Ψ(w1)={2,2}, Ψ(w2)={1,3}, Ψ(w3)=(3,0).

Parikhs Theorem

For every context-free language L. Ψ(L) is effectively semilinear. The tuples specifying Ψ(L) can be
constructed effectively from a context-free grammar generating L.

Pumping Lemma for CFL

Pumping Lemma for CFL is generally used to prove a language is not context free.

Let L be any CFL. Then there is a constant n, depending only on L, such that if z is in L and |z|≥n. Then
we may write w=uvwxy such that

1) |vx|≥1
2) |vwx|≤n

3) For all i≥0, uviwxiy є L.

Languages that are not CFL

{anbn cn|n≥1 } is not CFL.

{ap|p is prime} is not CFL.

Q. Show that L= {ap|p is prime} is not CFL.

Solution:-

Let us consider z=aaaaa

u=a,v=a,w=a,x=a,y=a,

Let us consider i=3

uv3wx3y=aaaaaaaaa=a9 doesn’t belong to L.

Hence L is not context free.

CLOSURE PROPERTIES OF CFL

1. CFLs are closed under union, concatenation and Kleen closure.

2. CFLs are closed under substitution.

3. CFLs are closed under homomorphism.

4. CFLs are closed under inverse homomorphism.

5. If L is a CFL and R is a regular set, then L∩R is a CFL.

 MODULE 3

TURING MACHINE MODEL

The TM can be thought of as a finite state automaton connected to a R/W head. It has one tape which is
divided into number of cells.

……………… a1 a2 a3 a4 ……………

Reading/Writing head

Finite State automation

Each cell can store only one symbol. R/W examines the tape symbols. In one move, the machine
examines the present symbol under R/W head on the tape and the present state of an automation to
determine:

1) A new symbol to be written in the tape in the cells under R/W head.

2) A motion of the R/W head along the tape either the head moves one cell left on one cell
right.

3) The next state of automation.

The formal notation of TM:

A TM is a 7-tuple notation

M=(Q,∑,┌,δ,q0,B,F) where

Q=Finite set of states.

∑=Finite set of inputs.

┌=Finite set of tape symbols.

δ =Qx┌=Qx┌x{L,R}

q0=Initial state

B=Blank symbol.

FQ is a set of final states.

 Q. Construct a Turing Machine that accepts {an bn cn|n≥1}

Instanteneous Description

q0aaabbbccc|-- X q1aabbbccc |-- Xa q1abbbccc|-- Xaaq1bbbccc|-- XaaYq2bbccc|-- XaaYbq2bccc|--

XaaYbbq2ccc|-- XaaYbq3bZcc|-- XaaYq3 bbZcc|-- Xaaq3YbbZcc|--Xaq3 aYbbZcc|-- Xq3 aaYbbZcc|--
q3XaaYbbZcc|--X q0aaYbbZcc|-- X Xq1aYbbZcc|-- X Xaq1YbbZcc|-- X XaYq1bbZcc|-- X XaYYq2bZcc|-
- X XaYYbq2Zcc|-- X XaYYbZq2cc|-- X XaYYbq3 ZZc|-- X XaYYq3 b ZZc|-- X XaYq3Y b ZZc|-- X
Xaq3 YY b ZZc|-- X Xq3 aYY b ZZc|-- X q3X aYY b ZZc|--X Xq0 aYY b ZZc|-- X XXq1 YY b ZZc|-- X
XXYq1 Y b ZZc|-- X XXYYq1 b ZZc|-- X XXY Y Y q2 ZZc|-- X XXY Y Y Z q2 Zc|-- X XXY Y Y Z Z
q2c|-- X XXY Y Y Z q3 Z Z|-- X XXY Y Y q3Z Z Z|-- X XXY Y q3 YZ Z Z|-- X XXY q3Y Y Z Z Z|-- X
XX q3Y Y YZ Z Z|-- X X q3X Y Y YZ Z Z|--X X X q0 Y Y YZ Z Z|-- X X X Y q4 Y YZ Z Z|-- X X X
Y Y q4 YZ Z Z|-- X X X Y Y Y q4 Z Z Z|-- X X X Y Y Y Z q4 Z Z|-- X X X Y Y Y Z Z q4 Z|-- X X X Y
Y Y Z Z Z q4|-- X X X Y Y Y Z Z ZB qfB

a|a,R
State Transition Diagram
Y|Y,R
a|X,R
q1
b|b,R
q0
S b|Y,L
X|Y,R

Y|Y,R q2 Z|Z,R
Y|Y,R c|Z,L

q4 q3
Z|Z,R
UNIVERSAL TURING a|a,L MACHINE Z|Z,L
B|B,R
A general-purpose Turing machine is usually called universal Turing machine which is powerful enough
to simulate the behavior of any computer. Universal Turing machine can simulate the behavior of an
qf Y|Y,L b|b,L
arbitrary Turing machine.

Deterministic Turing Machine

A Turing machine is called deterministic if at most one description can be possible from any description.

OR

There exists at most one entry in any cell of state transition table representation of Turing machine.

Nondeterministic Turing Machine

A Turing machine is called nondeterministic if more than one description can be possible from at least
one description.

OR

There exists more than one entry in at least one cell of state transition table representation of Turing
machine.

RECURSIVE LANGUAGE & RECURSIVELY ENUMERABLE SET

A language L over the alphabet ∑ is called recursive if there is a TM say T, that accepts every word in L
and rejects every word in L΄, that is

Accept(T)=L, Reject(T)= L΄, Loop(T)=φ

A language L over the alphabet ∑ is called recursively enumerable if there is a TM say T, that accepts
any word in L and either reject or loops forever for every word in L΄, that is

Accept(T)=L

Reject(T) +Loop(T)= L΄

LINEAR BOUNDED AUTOMATA

This model accepts the set of context-sensitive languages, the length of the tape is restricted by a linear
function.

A LBA is a nondeterministic Turing machine which has a single tape whose length is not infinite but
bounded by a linear function.

The model can be formally defined as M(Q,∑,┌,δ,q0,B,$,§,F)

Q=Finite set of states.

∑=Finite set of inputs.

┌=Finite set of tape symbols.

δ =Qx┌=2Qx┌x{L,R}

q0=Initial state

B=Blank symbol.

FQ is a set of final states.

$=Left end mark

§=Right end mark

CONTEXT SENSITIVE LANGUAGE

 A language L is said to be context sensitive if there exists a context sensitive grammar G, such that
L=L(G) or L=L(G)Uє. Whereas the context sensitive grammar is defined as grammar G={V,T,P,S}, the
products are in the form

XY, where X,Y є(VUT)* and |Y|≥|X|

A context sensitive grammar can never generate a language containing the empty string i.e. Xє is not
allowed.

Primitive Recursive Functions

Basic Functions

1. Zero Function – Z(x)=0, for all xєI.

2. Successor Function – S(x)=x+1
3. Projector Function Pk(x1,x2) =xk, k=1,2

Composition and Primitive Recursion are used to build more complicated functions from the basic
functions.

1. Composition f(x,y)=h(g1(x,y),g2(x,y))
2. Primitive Recursion
f(x,0)=g1(x)
f(x,y+1)=h(g2(x,y),f(x,y))

A function is called Primitive Recursive if and only if it can be constructed from the basic
functions Z,S,Pk by successive composition and primitive recursion.

Ackermanns Function

A(0,y)=y+1
A(x,0)=A(x-1,1)
A(x,y)=A(m-1,A(m,n-1))

Addition, Multiplication functions are the Primitive Recursive function but Ackermanns function
is not Primitive Recursive.
So for the construction of Ackermanns Function and some other functions μ-recursive function is
required.

A function is μ-recursive if it can be constructed from the basic functions by a sequence of μ-

operator and the operations of composition and primitive recursion.
Godel Number

In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-
formed formula of some formal language a unique natural number, called its Gödel number.

A Gödel numbering can be interpreted as an encoding in which a number is assigned to each

symbol of a mathematical notation, after which a sequence of natural numbers can then represent
a sequence of symbols. These sequences of natural numbers can again be represented by single
natural numbers, facilitating their manipulation in formal theories of arithmetic.

Gödel used a system based on prime factorization. He first assigned a unique natural number to
each basic symbol in the formal language of arithmetic with which he was dealing.

To encode an entire formula, which is a sequence of symbols, Gödel used the following system.
Given a sequence of positive integers, the Gödel encoding of the sequence
is the product of the first n primes raised to their corresponding values in the sequence:

enc(x1 ,x2 ,x3 ,….,xn)=2x1. 3x2….pxn

According to the fundamental theorem of arithmetic, any number obtained in this way can be
uniquely factored into prime factors, so it is possible to recover the original sequence from its
Gödel number.

Example:-

Suppose the Gödel number for the symbol "&" is 2 and the Gödel number for the symbol "=" is
5. Thus, the Gödel number of the formula "& = " is 22.35=972.

Post Correspondence Problem

Halting problem is an undecidable problem. So it is not possible to work with halting problem directly.
And it is convenient to establish some intermediate results that bridge the gap between halting problem
and other problems.

The intermediate result follow from the undecidability of the halting problem. But much more closer to
the problem that we want to study. One such intermediate result is Post Correspondence Problem.

PCP Statement

Given two sequence of n strings on some alphabet ∑, say A=w1,w2,….,wn and B=v1,v2,……,vn we say
there exists a post correspondence solution for pair( A,B)if there exist a nonempty sequence of integers
i,j,….,k such that wi wj…..wk=vi vj……vk.
Example:- Let ∑={0,1} and take A and B as

A w1=00, w2=101,w3=110

Bv1=001,v2=011,v3=10

For integer sequence <1,2,3> there exist a PCP solution because w1 w2 w3=v1 v2 v3 .

Suppose

A w1=00, w2=101,w3=110

Bv1=001,v2=011,v3=101

No PCP solution because |B|>|A|.

The Post correspondence problem is undecidable.

Decidable Problem

A problem is decidable if an algorithm can be written to solve it.

P,NP,NP-COMPLETE & NP-HARD CLASSES

P is the set of all decision problems solvable by deterministic Turing machine in polynomial time.NP is
the set of all decision problems solvable by nondeterministic Turing machine in polynomial time.

A problem L is NP-hard if and only if satisfiability reduces to L. A problem L is NP-complete if and

only if L is NP-hard and LєNP.

Disclaimer

This above material may contain some mistakes. So the reader can read carefully.