AQAā¢A-Levelā¢Computer Science
š§®
Theory of Computation
Abstraction, automata, regular expressions, BNF, and computability
Practice 48 subtopics in Theory of Computation. All questions match the AQA A-Level specification.
About Theory of Computation
Theory of Computation is a key topic in the AQA A-Level Computer Sciencespecification. This topic covers abstraction, automata, regular expressions, bnf, and computability.
Master all 48 subtopics below with unlimited AI-generated questions. Each subtopic page includes sample questions and the ability to generate unlimited practice questions with detailed solutions.
All Subtopics (48)
š²
Random Practice
Practice any subtopic from Theory of Computation
Problem solvingAbstractionInformation hidingProcedural abstractionFunctional abstractionData abstractionDecompositionCompositionAutomationFinite state machinesMealy machinesMoore machinesState transition diagramsState transition tablesSetsSet notationSet comprehensionCartesian productSubsetsUnionIntersectionDifferenceRegular expressionsRegular expression symbolsPattern matchingRegular languagesBackus-Naur Form (BNF)Syntax diagramsContext-free grammarsParse treesBig O notationTime complexitySpace complexityO(1) - constantO(log n) - logarithmicO(n) - linearO(n log n) - linearithmicO(nĀ²) - polynomialO(2^n) - exponentialTractable problemsIntractable problemsHeuristic approachesTuring machinesUniversal Turing machineHalting problemComputabilityComputable problemsNon-computable problems
Start Practicing Theory of Computation
Choose any subtopic above to begin practicing with unlimited AI-generated questions.
Start with Problem solving