Scribd
Upload
13 views

Theory of Computation Notes

Uploaded by

parwatprogrammer
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
13 views

Theory of Computation Notes

Uploaded by

parwatprogrammer
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

1. Automata Basics

- Finite Automata (DFA & NFA)

- Regular Languages and their Closure Properties

- Connection between Regular Grammar and Regular Expressions

2. Pushdown Automata (PDA)

- Relation between Context-Free Languages (CFL) and PDA

- Leftmost and Rightmost Derivations

- Ambiguity and Grammar Simplification

3. Turing Machines (TM)

- Single-tape and Multi-tape Turing Machines

- Universal Turing Machine (UTM)

- Computable and Non-Computable Functions

4. Mealy and Moore Machines

- Differences between Mealy and Moore Machines

- Conversion between Mealy and Moore Machines

5. Language Hierarchies

- Chomsky Hierarchy

- Regular, Context-Free, Context-Sensitive, and Recursively Enumerable Languages

6. Important Theorems

- Pumping Lemma for Regular and Context-Free Languages

- Myhill-Nerode Theorem

- Decidability and Undecidability Theorems


7. Complexity Theory

- P, NP, NP-Hard, and NP-Complete Problems

- Polynomial Time and Reducibility Concepts

8. Applications and Examples

- Practical DFA Applications

- Hamiltonian Path Problem

- Signed Integer Acceptance via CFG

You might also like