Theory Of Automata

Theory of automata 

Course Covered 

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

MCQs of Theory of Automata and Computation

Past Papers of Theory of Automata and Computation

 

Add a Comment