A-level Computing/AQA/Paper 1/Theory of computation
< A-level Computing < AQA < Paper 1Abstraction and Automation
- Regular languages
- Finite state machines
- Maths for regular expressions
- Compact set notation
- Regular expressions
- Regular languages
- Backus-naur form
- Classification of algorithms
- Comparing algorithms
- Maths for big-O notation
- Order of complexity
- Limits of computation
This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.