0% found this document useful (0 votes)
14 views

Important_Topics_Notes

TOC study material

Uploaded by

vecnaog
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
0% found this document useful (0 votes)
14 views

Important_Topics_Notes

TOC study material

Uploaded by

vecnaog
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 Topics Notes

1. Finite Automata (FA):

- Design and properties of DFA and NFA.

- Conversion between DFA and NFA.

- Properties of transition functions.

- Applications of finite automata.

2. Pushdown Automata (PDA):

- Explanation and examples of PDA.

- Instantaneous descriptions of PDA.

- Comparison between DPDA and NPDA.

3. Turing Machines (TM):

- Design of Turing machines for specific problems (e.g., addition of two numbers).

- Types of Turing machines (universal, multitape, etc.).

- Halting problem and decidability.

4. Grammar and Languages:

- Ambiguity in grammars.

- Construction of CFG for given expressions and languages.

- Context-free grammar (CFG) design for specific languages.

- Closure properties of regular and context-free languages.

5. Regular Expressions:

- Conversion of regular expressions to automata.


- Design of regular expressions for specific sets.

6. Pumping Lemma:

- Proofs of non-regular languages using the pumping lemma.

- Properties of regular languages.

7. Decidability:

- Concepts of decidable and undecidable problems.

- Recursively enumerable languages and related properties.

8. Complexity Classes:

- Difference between P and NP problems.

- Explanation of NP-hard problems.

9. Theoretical Concepts:

- Arden's theorem.

- Hamiltonian path problem.

- Ambiguity in grammars.

10. Short Notes Topics:

- Halting problem.

- Chomsky Normal Form (CNF).

- Properties of recursively enumerable sets.

These notes summarize the key topics from the past five years' question papers and are critical for

exam preparation.

You might also like