Welcome to the syllabus and index for Theory Of Computation.
- Basics
- ambiguity-in-context-free-grammar-and-languages
- applications-of-various-automata
- check-if-the-language-is-context-free-or-not
- closure-properties-of-context-free-languages
- code-implementation-of-deterministic-finite-automata-set-1
- construct-a-turing-machine-for-language-l-ww-w-01
- construct-a-turing-machine-for-language-l-wwr-w-0-1
- construct-pushdown-automata-for-all-length-palindrome
- construct-pushdown-automata-for-given-languages
- context-sensitive-grammar-csg-and-language-csl
- converting-context-free-grammar-to-chomsky-normal-form
- converting-context-free-grammar-to-greibach-normal-form
- designing-finite-automata-from-regular-expression-set-1
- detailed-study-of-pushdown-automata
- generating-regular-expression-from-finite-automata
- grammar-in-theory-of-computation
- introduction-of-finite-automata
- introduction-of-pushdown-automata
- operator-grammar-and-precedence-parser
- problems-on-finite-automata
- problems-on-pushdown-automata
- problems-on-turing-machine
- program-for-deterministic-finite-automata
- pushdown-automata-acceptance-by-final-state
- regular-expressions-regular-grammar-and-regular-languages
- relationship-between-grammar-and-language-in-theory-of-computation
- simplifying-context-free-grammars
- star-height-of-regular-expression-and-regular-language
- theory-of-computation-tutorial
- turing-machine-as-comparator
- turing-machine-for-1s-and-2s-complement
- turing-machine-for-addition
- turing-machine-for-copying-data
- turing-machine-for-multiplication
- turing-machine-for-subtraction-set-1
- turing-machine-for-subtraction-set-2
- turing-machine-in-toc
- union-and-intersection-of-regular-languages-with-cfl