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.
Your progress in this subject0 of 8 · 0%
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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
- Strings, languages and finite automata· notes coming
- NFA and ε-NFA· notes coming
- Converting NFA to DFA· notes coming
- Regular expressions and identities· notes coming
- Converting RE to FA· notes coming
- Arden's theorem: FA to RE· notes coming
- Closure properties of regular languages· notes coming
- Chomsky hierarchy· notes coming
- Regular grammars and finite automata· notes coming
- Parse trees and ambiguity· notes coming
- Pushdown automata and acceptance· notes coming
- Designing pushdown automata· notes coming
- Equivalence of CFG and PDA· notes coming
- Turing machines and their design· notes coming
- Variants of Turing machines and the universal TM· notes coming
- P, NP and polynomial-time reduction· notes coming
- NP-complete problems, SAT and Cook's theorem· notes coming
- Approximation algorithms· notes coming
- Chomsky and Greibach normal forms· notes coming
- Applications of automata· notes coming
- Compiler phases· notes coming
- Compiler-construction tools· notes coming
- Lexical analysis and input buffering· notes coming
- Specifying and recognising tokens· notes coming
- Lexical-analyser generators: Lex· notes coming
- Top-down parsing: FIRST, FOLLOW and LL(1)· notes coming
- Bottom-up parsing: LR parsers· notes coming
- Operator-precedence parsing· notes coming
- Syntax-directed translation· notes coming
- Three-address code· notes coming
- Type checking· notes coming
- Control flow and backpatching· notes coming
- Code generation issues· notes coming
- Basic blocks and flow graphs· notes coming
- Code optimisation and peephole optimisation· notes coming
- Bootstrapping and compilers versus interpreters· notes coming
- Recursive-descent and predictive parsing· notes coming
- Parser generators: YACC· notes coming
- Symbol tables· notes coming
- DAG representation of basic blocks· notes coming
- Run-time storage organisation· notes coming
- Error detection and recovery in compilers· notes coming
- Global data-flow analysis and loop optimisation· notes coming
- Church–Turing thesis· notes coming
- Recursive and recursively enumerable languages· notes coming
- Post correspondence problem· notes coming
- Register allocation and assignment· notes coming