Scribd
Upload
4 views2 pages

Toc Important Questions

The document outlines important questions for a college semester exam on the Theory of Computation, covering topics such as the Chomsky Hierarchy, types of grammars, automata (DFA, NFA, PDA), and Turing Machines. It includes both theory-based and construction-based questions, emphasizing conversions between models and closure properties. Additionally, it provides tips for exam preparation, including practicing automata drawings and understanding standard constructions.

Uploaded by

jajantidas1980
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
4 views2 pages

Toc Important Questions

The document outlines important questions for a college semester exam on the Theory of Computation, covering topics such as the Chomsky Hierarchy, types of grammars, automata (DFA, NFA, PDA), and Turing Machines. It includes both theory-based and construction-based questions, emphasizing conversions between models and closure properties. Additionally, it provides tips for exam preparation, including practicing automata drawings and understanding standard constructions.

Uploaded by

jajantidas1980
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

Theory of Computation - Important Questions for College Semester Exam

Section A: Theory-Based Questions

1. Explain Chomsky Hierarchy.

2. List all four types of grammars and languages with suitable examples.

3. Differentiate between DFA, NFA, and ε-NFA.

4. Include definitions, differences, and conversion techniques.

5. What is a Regular Expression?

6. Explain conversion from Regular Expression to NFA and vice versa.

7. Prove that Regular Languages are closed under union, concatenation, and Kleene star.

8. Define Pumping Lemma for Regular Languages.

9. Use it to prove a given language is not regular.

10. What is a Context-Free Grammar (CFG)?

11. Explain derivations, ambiguity, and parse trees.

12. Explain Pushdown Automata (PDA).

13. Describe its components and conversion from CFG to PDA.

14. Differentiate between deterministic and non-deterministic PDA.

15. Provide examples.

16. What is a Turing Machine?

17. Describe its structure and give an example.

18. Explain the Halting Problem.

◦ Why is it undecidable?

19. What is Undecidability?

◦ Include examples and concept of reducibility.

1
20. Distinguish between recursively enumerable and recursive languages.

Section B: Automata and Construction-Based Questions

1. Construct a DFA for the language accepting strings over {0,1} with an even number of 0s.

2. Design an NFA that accepts strings ending in '01'.

3. Convert the given NFA to DFA.

4. (State diagram usually provided in exams)

5. Construct a Regular Expression from a given DFA.

6. Minimize a given DFA.

7. Perform state minimization and draw the minimized DFA.

8. Design a PDA for L = { a^n b^n | n ≥ 0 }.

9. Construct a PDA for palindromes over {a, b}.

10. Design a CFG for L = { a^n b^m | n ≠ m }.

11. Convert the given CFG to CNF (Chomsky Normal Form).

12. Design a Turing Machine for the following:

◦ a) Palindrome: L = { ww^R | w ∈ {0,1}* }


◦ b) Unary addition: L = { 1^n # 1^m # 1^{n+m} }

Tips: - Understand conversions between models (RE ↔ NFA ↔ DFA, CFG ↔ PDA). - Practice drawing
automata cleanly. - Remember standard constructions (even 0s, palindromes, etc.). - Prepare for closure
property proofs and language classification.

You might also like