Computation
Anki flash cards related to computation.
- Deduction
-
-
- Term and formula assignment
- Languages, terms and formulas
- Chomsky normal form
- Context-free languages
- Context-free languages: closed operations
- Examples of decidable and undecidable languages
- Confluence
- β-normal form
- β-reduction
- Examples of decidable and undecidable languages
- Language and Turing machine visualization
- Number theory is undecidable
- Lamba terms. Definition.
- Subject map
- Turing-recognizable and Turing-decidable
- Turing machine
- Convert regular expression → NFA state diagram
- Convert regular expression → NFA state diagram
- Convert regular expression → NFA state diagram
- Convert regular expression → NFA state diagram
- Convert regular expression → NFA state diagram
- Pumping lemma for regular languages
- Nondeterministic finite automata (NFA)
- Regular expressions
- Alphabets and languages
- Finite automata
- Regular language operators
Download: deck package (import with Anki)