Assignment from Unit-1

1) What is TOC? What are the area of TOC?

 TOC stands for Theory of Computation which is a theoretical branch of computer science
which deals with how efficiently problems can be solved on a model of computation,
using an algorithm. It develops formal mathematical models of computation that reflect
real-world computers.
The Theory of Computation can be divided into the following three areas:
1. Automata Theory :- It is the study of abstract mathematical machines and the
computational problems that can be solved using these machines. It deals with
definitions and properties of different types of computation models such as:
a. Finite Automation - Used in text processing, compiler and hardware design.
b. Context Free Grammar - Used to define programming language and in artificial
Intelligence.
c. Turning Machine - Used to form simple abstract model of a real computer such as
PC at Home.

2) Computability Theory :- Computability theory, also known as recursion theory, is the

area of mathematics dealing with the concept of an effective procedure which can
be carried out by following specific rules.

3) Complexity Theory :- Complexity theory and organizations, also called complexity

strategy or complex adaptive organizations, is the use of the study of complexity
systems in the field of strategic management and organizational studies. It draws
from research in the natural sciences that examines uncertainty and non-linearity.
Complexity theory emphasizes interactions and the accompanying feedback loops
that constantly change systems. While it proposes that systems are unpredictable,
they are also constrained by order-generating rules.

2. Why the study of Automata Theory is fretful and futuristic of computer Science
students?
 Automata Theory is a branch of computer science that deals with designing abstract self
-propelled computing devices that follow a predetermined sequence of operations
automatically. Automata theory is important because it allows scientists to understand
how machines solve problems. An automaton is any machine that uses a specific,
repeatable process to convert information into different forms. Modern computers are a
common example of an automaton.
If scientists didn't study automata theory, they would have a much more difficult time
designing systems that could perform repeatable actions based on specific inputs and
outputs. Scientists are able to design systems that can perform specific tasks, such as
personal computer systems, automatic aircraft pilots and many more, by using automata
theory. There are a number of other examples of automatons.
These range from basic devices, such as a pendulum clock, to missile guidance systems
and complex telephone networks. Thermostats are a familiar example of an automaton.
A thermostat checks the temperature of its surrounding environment at specific
intervals, and then turns on when the temperature reaches a certain level. In this case,
there are only two potential states for the thermostat: on or off.
 Automatons can be much more complex than a thermostat. Modern computers have a
large number of data inputs and potential states. Automata theory is used to design
computers that respond to inputs by producing reliable outputs.

3. What is logic ? Write truth table with example of conditional and bicondional
logic?
 A system on set of principle underlying the arrangements of elements in a computer or
electronic device so as to perform a specified task is called logic. For example to design
Digital Circuit.
Conditional Logic: If p and q are prepositions the conditional of q by p is p implies q and
is denoted by p+q which is false when p is true and q is false otherwise it is true.
For example: i) If you work hard, then you will succeed
ii) If 2 is an even number, then 2+2=5

Truth Table

P q P->q
T T T
T F F
F T T
F F T

Biconditional logic:- If p and q are prepositions, the biconditional of p<-> p read as “p if and
only if q” is true when p and q have the same truth values and is false otherwise.

For example : i) If p: you can play outdoor.

ii) The weather is fine, then p<->q denotes You can play outdoor if and only if
the weather is fine.

Truth Table:

P q P<->q
T T T
T F F
F T F
F F T

4. What is proposition? Write any four example of proposition?

 A proposition is a declarative sentence that is either true (denoted either T or 1) or false
(denoted either F or 0).
For Example :-
“Drilling for oil caused dinosaurs to become extinct.” is a proposition.
2 Five is odd = True
5>10 = False
By heating water becomes gas = True

5. Define alphabet, string and language with example?

 Alphabet: An alphabet is a finite, non-empty set of symbols. The alphabet of a language
is normally denoted by Ʃ.
For eg: Ʃ = {0,1}
Ʃ = { x,y,z}

String: A string is a finite sequence of concatenated symbols of an alphabet Ʃ.

For ex: Ʃ={0,1}, then string is {0110, 11, 001}

Language: Language (1) over the alphabet Ʃ is the subset of string. String, Ʃ can be called
as languages. For ex: Ʃ = {a,b}
L=collection of length 2 = {aa, ab, ba, bb}.

6. Proof that string and language may or may not be finite with example?
 String is a collection of alphabet on sequence of alphabet.
It is finite. For e.g:
We have alphabet Ʃ={x,y,z}
And length of string = 3, then we get string as,
{xxx,xxy,xyx,xyy,yxy,yyx,yyy} which is finite. Hence, string is finite.

Language is collection of all possible string over given alphabet Ʃ. It is denoted by L/

For eg:
we have alphabet, Ʃ={0,1} which is also a string.
Then,
L1= collection of length 2
= {00,01,10,11} (is finite)
Again,
L2= all string start with 0 and end with 1
= {01, 001,011, 0101,………} (not finite)
From above example, we can conclude that language may or may not be finite.

7. Define Kleene closesure, positive closure and contamination of string with

example?
 Kleene Closure: It is the set of all possible over given alphabet including epsilon. It is
denoted by Ʃ*.
For ex: if Ʃ ={x,y}, Ʃ*={ Ʃ,x,y,xx,yy,xy,……….}

Positive Closure: It is the infinite set of all possible strings of all possible lenths over an
alphabet Ʃ excluding epsilon. It is denoted by Ʃ+.
We have ,
Ʃ*= Ʃ* + Ʃ0
Ʃ+ = Ʃ* - Ʃ0

For eg: if Ʃ= { x,y}, Ʃ_ = { x,y,xx,yy,xy……….}

Concatenation of string:
The operation of joining characters strings end- to-end is known as concatenation of
string.
Let w1 andw2 be two strings, Then w1.w2 denotes the concatenation of w1 and w2.
For eg: Let w1= abc and w2= xyz then
W1.w2= abc.xyz