OCR•A-Level•Computer Science
🧮
Theory of Computation
Finite state machines, regular expressions, and BNF
Practice 29 subtopics in Theory of Computation. All questions match the OCR A-Level specification.
About Theory of Computation
Theory of Computation is a key topic in the OCR A-Level Computer Sciencespecification. This topic covers finite state machines, regular expressions, and bnf.
Master all 29 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 (29)
🎲
Random Practice
Practice any subtopic from Theory of Computation
Finite state machinesMealy machinesMoore machinesState transition diagramsState transition tablesAcceptorsRecognisersSet theorySet notationFinite and infinite setsCountably infiniteSubsetsUnionIntersectionDifferenceCartesian productRegular expressionsPattern matchingMetacharactersRegular languagesBackus-Naur Form (BNF)Syntax diagramsParsingContext-free grammarsParse treesReverse Polish notationInfix to RPNEvaluating RPNUsing stacks for RPN
Start Practicing Theory of Computation
Choose any subtopic above to begin practicing with unlimited AI-generated questions.
Start with Finite state machines