Theory of Computation — A-Level Revision Notes

3 notes on Theory of Computation for A-Level Computer Science.

Finite State MachinesA finite state machine (FSM) is an abstract model of computation with… Regular Expressions and Finite State MachinesRegular expressions and finite state machines are two sides of the… Turing Machines and the Halting ProblemThe Turing machine is the theoretical foundation of all modern…

What these notes cover

← All A-Level Computer Science notes