Theory of Computation — A-Level Revision Notes
3 notes on Theory of Computation for A-Level Computer Science.
What these notes cover
- Finite State Machines — Finite state machines; Key parts; Two types; State transition diagrams and tables; FSMs and regular languages; Limits
- Regular Expressions and Finite State Machines — Regular Expressions and Finite State Machines
- Turing Machines and the Halting Problem — Turing Machines and the Halting Problem
← All A-Level Computer Science notes