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.
Your progress in this subject0 of 6 · 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.
- 3Pumping 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.
- 4Simplification 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.
- 5Pumping 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.
- 6Decidability 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.
Coming next in Theory of Computation
- Alphabets, strings and languages· notes coming
- Chomsky hierarchy· notes coming
- NFA and ε-NFA· notes coming
- Equivalence of NFA and DFA· notes coming
- Regular expressions and identities· notes coming
- Arden's theorem: FA to RE· notes coming
- Converting RE to FA· notes coming
- Regular grammars and finite automata· notes coming
- Closure properties of regular languages· notes coming
- Derivation trees, sentential forms and ambiguity· notes coming
- Chomsky and Greibach normal forms· notes coming
- Pushdown automata and acceptance· 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
- Linear bounded automata and context-sensitive languages· notes coming
- Recursive and recursively enumerable languages· notes coming
- Post correspondence problem· notes coming
- Church–Turing thesis· notes coming
- Closure properties of context-free languages· notes coming
- Reducibility and Rice's theorem· notes coming
- Complexity measures for Turing machines· notes coming
- Space complexity classes: PSPACE, L and NL· notes coming
- Primitive recursive and μ-recursive functions· notes coming
- Deterministic pushdown automata· notes coming