PART-A

1. Define the following:

a. Symbol
A symbol is an abstract entity. Letters and digits are symbols.
b. String:
A string is a finite sequence of symbols.
Eg: abc, dog are strings
c. Language:
A language is a set of strings of symbols from one alphabet.
Ф, { ϵ} are languages.
Alphabet:
An alphabet is a finite set of symbols.
2. What is relation?
A binary relation is a set of pairs. The first component of each pair is
chosen from a set called the domain and the second component of each pair is
chosen from a set called a range.
What are the properties of relation?
a. Reflexive:
If aRa for all a in S
b. Irreflexive:
aRa is false for all a in S
c. Transitive:
aRb and bRc imply aRc
d. Symmetric:
aRb implies bRa
e. Asymmetric:
aRb implies that bRa is false

3. What is an equivalence relation?

A relation R that is

i. Reflexive
ii. Symmetric
iii. Transitive
is said to be an equivalence relation.
4. What are the methods of formal proof?
i. Deductive proof
ii. Reduction to definition
iii. Other theorem forms
iv. Theorems that appear not to be if-then statements
 5. What are the applications of theory of computation?
i. Compiler design
ii. Robotics
iii. Artificial intelligence
iv. Knowledge engineering
6. What is finite state system?

Finite state system:

The finite Automaton is a mathematical model of a system with discrete inputs

and outputs. The system with discrete inputs and outputs. The system can be in
any one of the finite number of internal states and input symbols.

Input Tape
0 + 1 . . .
tape head

Finite
control

7. what is Deterministic Finite Automata(DFA)?

DFA:

DFA is defined by a 5 tuple.

M=(Q,Σ,δ,q0 ,F)

Where

Q- is a finite set of states

Σ- is a finite input alphabet

q0- in a q is a

9. Define Non deterministic finite automata (NFA)

NFA :

NFA is defined as 5 tuples

M = (Q,Σ,δ,q0,F)

Q-> Set of states

Σ -> set of input symbols

 δ > is a transition function mapping from

Qx Σ-> 2Q

qo -> an initial state

F -> set of final stater F<Q

10. Define the language accepted by finite automata?

The language accepted by FA:

The language accepted by FA is called as regular language. It is denoted

as L(M)

L(M) = {X \ δ(q0,x) = p, for p in F}

11. Define ε-closure (q)

ε-closure(q) is the set of all vertices p such that there is a path from q to p.

12. What are operations on languages?

1. concatenation :

The concatenation of L1 and L2 is

L1L2={ xy|x is in L1 and y is in L2}

2.The kleen closure:

L* = U L i

ie. Zero or more occurrences of a string in L

Lo = {E}

L i= L i-1 L1

ie. One or more number of occurrences of a string in L

13. What is regular expression?

Regular Expression:

1) Ф is a regular expression denoting the language { }

2) E is a regular expression denoting the language {E}
3) For each a in Σ , a is a regular expression denoting the language{a}
 4) If r and s are regular expression then r+s , rs and r* are regular expression
denoting the language.

14. State the pumping lemma for regular languages.

Pumping lemma:

Let L be a regular set , then there is a constant n and z is any word in L and |Z|
>- n , we can write z = uvw in such a way that

|uv|<- n

|V|>- and for all i>0 uv i w is in L

15. Construct a DFA that accepts input string of0,s and 1’s that end with 11.