## Theory of automata

**Course Covered **

- Introduction (Alphabets, Strings, Words)
- Descriptive definition of languages
- Regular Expression (28+ Examples)
- Finite State Automata (100+ Examples)
- Finite automata to regular expression conversion
- Transition Table
- CFG
- Chomsky normal Form
- https://t4tutorials.com/context-free-grammer-cfg-in-theory-of-automata/
- https://t4tutorials.com/context-free-grammer-cfg-for-language-of-all-even-length-strings/
- https://t4tutorials.com/cfg-for-the-language-of-all-non-palindromes/
- https://t4tutorials.com/cfg-of-language-of-all-even-and-odd-length-palindromes/
- https://t4tutorials.com/cfg-for-strings-with-unequal-numbers-of-a-and-b-context-free-grammar/
- https://t4tutorials.com/cfg-of-odd-length-strings-w-the-length-of-w-is-odd/
- https://t4tutorials.com/cfg-of-language-contains-at-least-three-1s-or-three-as-w-w-contains-at-least-three-1s/

- Push Down Automata (15+ Examples)
- Turing Machine (20+ Examples)
- Recursively enumerable languages

## MCQs of Theory of Automata and Computation

## Past Papers of Theory of Automata and Computation