Artificial Intelligence & Data Science is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Artificial Intelligence & Data Science

Theory of Computation

Finite automata and regular expressions, context-free grammars and pushdown automata, Turing machines, decidability and complexity.

Interview questions

Coming next in Theory of Computation

  1. Alphabets, strings and languages· notes coming
  2. Chomsky hierarchy· notes coming
  3. NFA and ε-NFA· notes coming
  4. Equivalence of NFA and DFA· notes coming
  5. Regular expressions and identities· notes coming
  6. Arden's theorem: FA to RE· notes coming
  7. Converting RE to FA· notes coming
  8. Regular grammars and finite automata· notes coming
  9. Closure properties of regular languages· notes coming
  10. Derivation trees, sentential forms and ambiguity· notes coming
  11. Chomsky and Greibach normal forms· notes coming
  12. Pushdown automata and acceptance· notes coming
  13. Equivalence of CFG and PDA· notes coming
  14. Turing machines and their design· notes coming
  15. Variants of Turing machines and the universal TM· notes coming
  16. Linear bounded automata and context-sensitive languages· notes coming
  17. Recursive and recursively enumerable languages· notes coming
  18. Post correspondence problem· notes coming
  19. Church–Turing thesis· notes coming
  20. Closure properties of context-free languages· notes coming
  21. Reducibility and Rice's theorem· notes coming
  22. Complexity measures for Turing machines· notes coming
  23. Space complexity classes: PSPACE, L and NL· notes coming
  24. Primitive recursive and μ-recursive functions· notes coming
  25. Deterministic pushdown automata· notes coming