Unit 4 Theory of computation

A concise summary of the notes I used when I was studying for my A-levels. I have checked that this summary follows all of the points on the AQA specification to ensure that it covers everything that you will need to know. It includes all of the definitions and examples that you need to know, as well as comparison tables to be able to quickly breakdown concepts and how they relate to eachother. I wrote this with the exam questions in mind and alot of the knowledge within it should be wo...

Level up your skills with these expertly written notes covering the theory of computation topic from the AQA A-level Computer Science specification. Whether you're preparing for Paper 1 or reinforcing your understanding throughout the year, this resource is designed to make complex concepts crystal clear (used and made by a consistently A/A* student). What’s Inside: - Detailed explanations - Clear breakdown to reinforce understanding - Key terminology to help you apply concepts effec...

Notes for the AQA A-Level in Computer Science on computational thinking. These notes include information about Turing machines, finite state and mealy machines, sets and set operations, regular languages and more. The document also includes small code snippets to support the theory. Important sections and keywords are highlighted, too.

This is a description of an automated theory course and its practical applications, including regular expressions, finite automata, and context-free grammars. An example of a finite automaton representing a game of tennis is provided. It also covers the concepts of languages, transition functions, and a simple protocol for sending data.

This document covers what you need to know about logic gates, containing each logic gate and their algebraic counterpart as well as examples of truth tables.

Notes on C17 - Abstraction and Automation of the AQA Computer Science textbook. [3 pages]