SHSubjectHub

Finite state machines with and without output

AQA 75174.4 L2A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 12 questions
  • 36 marks
  • about 40 minutes
  • marked instantly

Question types: short answer, matching, true or false, multiple choice.

Try it with a class, freeHow it works

Try one from this worksheet

This is the finite state machine from Question 3. Identify the string it accepts.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.4.2.1 Finite state machines (FSMs) with and without output. C# lesson 2 of 6 in 4.4 Theory of computation: a trace-the-dictionary Do Now, a short key idea, a 10-challenge ladder in three sets with exact test data, two exam questions and a worksheet. Replaces…

18 slides.

Lesson outline

  1. Do Now: trace the door
  2. Do Now: answers
  3. Key idea: A finite state machine and its table
  4. Key idea: Accepted or rejected?
  5. Quick check: accepted or rejected?
  6. Key idea: Mealy machines: output on transitions
  7. Key idea: Design an FSM: what must it remember?
  8. Set 1: the transition table in code
  9. Set 2: trace tables and other machines
  10. Exam question E1: with or without output
  11. Model answer E1
  12. Exam question E2: trace it from the table
Unit bundle4.4 Theory of computation · full lessons
Part of: 4.4 Theory of computation · full lessons: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation · full lessons