Scribd
Upload
163 views2 pages

Cs3452 Question Bank - TOC - 2324

The document contains questions from various units of the Theory of Computation course. It includes questions related to mathematical induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, undecidability and complexity.

Uploaded by

Dinesh Babu Pandiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
163 views2 pages

Cs3452 Question Bank - TOC - 2324

The document contains questions from various units of the Theory of Computation course. It includes questions related to mathematical induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, undecidability and complexity.

Uploaded by

Dinesh Babu Pandiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ARASUR 607107 – VILLUPURAM DIST

(Reaccredited by NAAC and an ISO 9001:2008 Recertified Institution)

Department of Computer Science and Engineering


CS3452- Theory of Computation
Question Bank (Part B & C)
Unit 1
1. State and prove the theorem of mathematical induction.
2. Problems based on mathematical induction
3. Problems based on DFA.
4. Problems based on NFA.
5. Problems based on conversion of NFA with ε transitions to NFA without ε transitions.
6. Problems based on conversion of NFA to DFA.
7. Problems based on conversion of NFA with ε transitions to DFA.
8. Problems based on Minimization of DFA.
9. Theorem: If L is accepted by NFA with ε transitions, then there exist L which is accepted by NFA
without ε transitions.
10. Theorem: Prove that if a Regular Language ‘L’ is accepted by a NFA then there exist a DFA that
accepts ‘L’. (or) Prove that equivalence of NFA and DFA.

Unit 2
1. Problems based on Regular Expressions.
2. Problems based on Conversion of Regular Expression to Finite Automata (by using Thompson’s
subset Construction).
3. Problems based on Conversion of Regular Expressions to Finite Automata (NFA with ε to DFA)
and find its minimization.
4. Problems based on Pumping Lemma (Proving not Regular Language).
5. Closure Properties of Regular Languages.
6. Problems based on Conversion of Finite Automata to Regular Expression
i. By using Rij(K) method.
ii. By using Arden’s Theorem.
7. Theorem: Prove that if a language ‘L’ is accepted by DFA, then L is denoted by a regular expression R.
8. Theorem: Prove that every regular language defined by a regular expression is also defined by finite
automata.

Unit 3
1. Problems based on Context Free Grammar.
2. Problems based on Context Free Language.
3. Problems based on Derivation, Parse Tree and Ambiguity.
4. Problems based on Unambiguous.
5. Problems based on PDA.
6. Problems based on DPDA.
7. Problems based on converting PDA to CFG.
8. Problems based on converting CFG to PDA.
9. Theorem: If the language L is a Context free language, then prove that there exists a PDA M such that
L=N(M) that is language accepted by empty stack.
10. Theorem: Prove that the language accepted by PDA using empty stack and final states are
equivalent.
Unit 4
1. Problems based on Simplification of Grammar.
2. Problems based on Chomsky Normal Form (CNF).
3. Problems based on Greibach Normal Form (GNF).
4. Problems based on Turing Machine.
i. Computing Integer Functions (Addition, Subraction, Multiplication, One’s & Two’s
Complement)
ii. Computable Language
5. Problems based on Pumping Lemma (Proving not CFL).
6. Closure Properties of Context Free Languages.
7. Construct a Turing machine for multiplying two non-negative integers using sub routines. (or)
Explain the programming techniques for Turing Machine construction (Sub routines)

Unit 5
1. Explain the Halting problem. Is it decidable or undecidable problem?
2. Explain briefly about Post’s Correspondence Problem.
2.1 Theorem: Prove that “MPCP reduces to PCP”.
2.2 Theorem: Prove that PCP is Undecidable.
3. Theorem: Prove that diagonalization language (Ld) is not a recursively enumerable.
4. Theorem: Prove that undecidability Universal language is recursively enumerable but not recursive.
5. Explain Tractable and intractable problem with suitable example.
6. Explain Universal Turing Machine.
7. Properties of Recursive and Recursive Enumerable Languages
- Theorems
8. Theorem: Prove that 3- SAT Problem is NP complete.

You might also like