A.P.

J abdul kalam university , indore

Theory of computation
Questions and Answers :
Q.1.Define following :
Ans :
1.Regular Sets and Regular Grammars :
: Regular sets : Any set that represents the value of the Regular Expression is called a Regular Set.

Properties of Regular Sets

Property 1. The union of two regular set is regular.

Property 2. The intersection of two regular set is regular.
Property 3. The complement of a regular set is regular.
https://www.tutorialspoint.com/automata_theory/regular_sets.htm
Regular grammer :
https://www.geeksforgeeks.org/regular-expressions-regular-grammar-and-regular-languages/
2.Finite automata and Regular expression :
: Regular Expression : https://www.geeksforgeeks.org/regular-expressions-regular-grammar-and-regular-
languages/
Regular Expressions are used to denote regular languages. An expression is regular if:
 ɸ is a regular expression for regular language ɸ.
 ɛ is a regular expression for regular language {ɛ}.
 If a ∈ Σ (Σ represents the input alphabet), a is regular expression with language {a}.
 If a and b are regular expression, a + b is also a regular expression with language {a,b}.
 If a and b are regular expression, ab (concatenation of a and b) is also regular.
 If a is regular expression, a* (0 or more times a) is also regular.

Finite Automata : https://www.geeksforgeeks.org/introduction-of-finite-automata/

Finite Automata(FA) is the simplest machine to recognize patterns.
A Finite Automata consists of the following :
Q : Finite set of states.
∑ : set of Input Symbols.
q : Initial state.
F : set of Final States.
δ : Transition Function.
Formal specification of machine is
{ Q, ∑, q, F, δ }.

Q.2.Proof the equivalence of NFA and DFA ? Write an example , which proof the conversion NFA and
DFA ?
Ans : The equivalence of NFA and DFA :
https://www.neuraldump.net/2017/11/nfa-and-dfa-equivalence-theorem-proof-and-example/
https://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/proof-nfa-2-dfa.html
Q.3.Consider the F.A equivalent to the regular expression
(0+1)*(00+1)(0+1)*.
Ans :

Q.4.Equivalence between Moor and Mealy machine proof with example ?

Ans : https://www.geeksforgeeks.org/mealy-and-moore-machines-in-toc/

Q.5.Explain Deterministic and Non Deterministic finite automata with example ?

Ans : Deterministic : https://www.tutorialspoint.com/automata_theory/deterministic_finite_automaton.htm
Non Deterministic :
https://www.tutorialspoint.com/automata_theory/non_deterministic_finite_automaton.htm

Q.6.Derive the regular expression from this F.A ?

Ans : https://www.geeksforgeeks.org/generating-regular-expression-from-finite-automata/

Q.7.Explain with example Chomsky Normal Form and Greibach Normal forms ?
Ans :
Chomsky Normal Form :
https://www.tutorialspoint.com/automata_theory/chomsky_normal_form.htm
Greibach Normal Form :
https://www.tutorialspoint.com/automata_theory/greibach_normal_form.htm

Q.8. Derive the regular expression r = (11+0)*(00+1)* to c move ?

Ans :

Q.9. Obtain an NFA for the regular expression (a+b)*aa(a+b)* ?

Ans :

Q.10.Design a DFA that accepting the following languages over alphabet {0,1} ?
Ans :

Q.11.The set of strings such that the number of 0’s is divisible by 5 , and the number of 1’s divisible by 3 ?
Ans :

Q.12.Define following :
Ans :
1.Pushdown Automata : https://www.geeksforgeeks.org/introduction-of-pushdown-automata/
2.Deterministic Pushdown Automata : https://www.javatpoint.com/non-deterministic-pushdown-automata
3.PDA corresponding to given CFG : https://www.zeepedia.com/read.php?
pda_corresponding_to_cfg_theory_of_automata&b=19&c=39
4.CFG corresponding to given PDA : https://www.javatpoint.com/automata-cfg-to-pda-conversion

Q.13.Prove the following are not regular language –

The set of string such that of form 0’1 such that greatest common divisor of I and j is 1 ?
Ans :
Q.14. Give the English description of the language of the following regular expression
a.(1+c)(00*1) 0* :
b.(0+10)*1* :
Ans :

Q.15.What is Pumping lemma and what is the closure property of regular set .Prove that regular sets are
closed under union , concatenation and Kleen closure ?n
Ans : https://www.geeksforgeeks.org/pumping-lemma-in-theory-of-computation/
http://www.coli.uni-saarland.de/projects/milca/courses/coal/html/node44.html

Q.16.Prove that any set L accepted by a finite automata M is represented by regular expression ?
Ans :

Q.17.Prove that following are not regular language ?

{ 0 n/n is a perfect cube } .
Ans :

Q.18.Explain in details notes on Universal Turning with example ?

Ans : https://www.ques10.com/p/10569/write-short-note-on-universal-turing-machine-1/

Q.19.Demostrate the working of your Turning Machine with example ?

Ans : https://www.tutorialspoint.com/automata_theory/turing_machine_introduction.htm

Q.20.Define following :
Ans :
1.NP Complete NP hard problems :
https://www.tutorialspoint.com/design_and_analysis_of_algorithms/design_and_analysis_of_algorithms_np_
hard_complete_classes.htm
2.Traveling salesman problem :
https://www.tutorialspoint.com/design_and_analysis_of_algorithms/design_and_analysis_of_algorithms_trav
elling_salesman_problem.htm
3.Partition Problem : https://www.geeksforgeeks.org/partition-problem-dp-18/

Q.21.Define following :
Ans :
1.Tractable and Untractable problem : http://www.cs.ucc.ie/~dgb/courses/toc/handout29.pdf
2.Recursive and Recurively enumerable language : https://www.geeksforgeeks.org/recursive-and-recursive-
enumerable-languages-in-toc/
3.Hamiltion path problem : https://www.geeksforgeeks.org/hamiltonian-cycle-backtracking-6/