CS Unplugged: Finite State Automata
Use the Treasure Hunt— Finite-State Automata offline activity to explore how a computer processes a sequence of symbols. The task uses a pirate treasure map to follow a set of instructions and record the journey using a sequence of symbols. Finite-state automata is used in Computer Science to help a computer process a sequence of characters or events. Support your teaching and learning with video clips and other related resources.
|Year band(s)||3-4, 5-6, 7-8, 9-10|
|Core and overarching concepts||Computational thinking|
|Keywords||Computational Thinking, Sequences, Patterns, Symbols, Finite-state automata|
University of Canterbury, New Zealand
Creative Commons BY-NC-SA 4.0