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.
Additional details
| Year band(s) | 3-4, 5-6, 7-8, 9-10 |
|---|---|
| Format | Web page |
| Core and overarching concepts | Computational thinking |
| Keywords | Computational Thinking, Sequences, Patterns, Symbols, Finite-state automata |
| Organisation | University of Canterbury, New Zealand |
| Copyright | Creative Commons BY-NC-SA 4.0 |
Related resources
-
A matter of style
In this lesson sequence, students using the Zen Garden website reflect on criteria for effective design.
-
Google CS First: Storytelling
CS First: Storytelling guides students to use block-based coding in Scratch projects through a series of themed activities.
-
Scope and sequence overview
This resource provides a possible set of sequenced topics that could be used in teaching the Australian Curriculum Digital Technologies curriculum to address the content descriptions of the curriculum.
-
F-2: Digital systems: Hardware and software
At the F-2 level, students develop understandings of digital systems (hardware and software) when they use some key functions to undertake authentic curriculum tasks.
-
F-2: Digital systems: Changes in Technology
Changes to technology over time has affected many aspects of life.