Information Technology 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.

Information Technology

Theory of Computation

Finite automata, regular expressions, grammars, PDAs and Turing machines, decidability, P and NP.

Interview questions
Your progress in this subject0 of 8 · 0%
  1. 1Deterministic finite automataDeterministic finite automata (DFA) are simple state machines that recognise regular languages; they are used in lexical analysis, pattern matching and protocol design.
  2. 2Minimisation of DFAMinimisation of a DFA means producing the smallest deterministic finite automaton that recognises the same regular language; it is done by removing unreachable states and merging equivalent states using partition refinement (Moore or Hopcroft) and is unique up to isomorphism.
  3. 3Moore and Mealy machinesMoore and Mealy machines are two kinds of finite-state machines that produce outputs: Moore outputs depend only on states, Mealy outputs depend on state and input; they are equivalent in expressive power but differ in where outputs are produced and in practical state counts.
  4. 4Context-free grammars and derivationsContext-free grammars (CFGs) define programming-language-like structures using productions; understanding formal definitions, derivations (leftmost/rightmost), and parse trees is essential for parsing, compiler front-ends and designing pushdown automata.
  5. 5Decidability and the halting problemDecidability studies which problems (languages) a Turing machine can always answer correctly; the halting problem is the classic undecidable example showing limits of algorithmic computation.
  6. 6Pumping lemma for regular languagesPumping lemma for regular languages gives a necessary property of every regular language and is used to prove some languages are not regular.
  7. 7Pumping lemma for context-free languagesPumping lemma for context-free languages: a necessary property used to prove some languages are not context-free, derived from parse trees of grammars in Chomsky normal form.
  8. 8Simplification of CFGsHow to simplify a context-free grammar by removing useless symbols, ε-productions, and unit productions while preserving the language (up to ε), with exact algorithms and worked examples.

Coming next in Theory of Computation

  1. Strings, languages and finite automata· notes coming
  2. NFA and ε-NFA· notes coming
  3. Converting NFA to DFA· notes coming
  4. Regular expressions and identities· notes coming
  5. Converting RE to FA· notes coming
  6. Arden's theorem: FA to RE· notes coming
  7. Closure properties of regular languages· notes coming
  8. Chomsky hierarchy· notes coming
  9. Regular grammars and finite automata· notes coming
  10. Parse trees and ambiguity· notes coming
  11. Pushdown automata and acceptance· notes coming
  12. Designing pushdown automata· 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. P, NP and polynomial-time reduction· notes coming
  17. NP-complete problems, SAT and Cook's theorem· notes coming
  18. Approximation algorithms· notes coming
  19. Chomsky and Greibach normal forms· notes coming
  20. Applications of automata· notes coming
  21. Compiler phases· notes coming
  22. Compiler-construction tools· notes coming
  23. Lexical analysis and input buffering· notes coming
  24. Specifying and recognising tokens· notes coming
  25. Lexical-analyser generators: Lex· notes coming
  26. Top-down parsing: FIRST, FOLLOW and LL(1)· notes coming
  27. Bottom-up parsing: LR parsers· notes coming
  28. Operator-precedence parsing· notes coming
  29. Syntax-directed translation· notes coming
  30. Three-address code· notes coming
  31. Type checking· notes coming
  32. Control flow and backpatching· notes coming
  33. Code generation issues· notes coming
  34. Basic blocks and flow graphs· notes coming
  35. Code optimisation and peephole optimisation· notes coming
  36. Bootstrapping and compilers versus interpreters· notes coming
  37. Recursive-descent and predictive parsing· notes coming
  38. Parser generators: YACC· notes coming
  39. Symbol tables· notes coming
  40. DAG representation of basic blocks· notes coming
  41. Run-time storage organisation· notes coming
  42. Error detection and recovery in compilers· notes coming
  43. Global data-flow analysis and loop optimisation· notes coming
  44. Church–Turing thesis· notes coming
  45. Recursive and recursively enumerable languages· notes coming
  46. Post correspondence problem· notes coming
  47. Register allocation and assignment· notes coming