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, Abstraction
Australian Curriculum Digital Technologies code(s)
AC9TDI4P02   

Follow and describe algorithms involving sequencing, comparison operators (branching) and iteration

AC9TDI6P02   

Design algorithms involving multiple alternatives (branching) and iteration

AC9TDI8P05   

Design algorithms involving nested control structures and represent them using flowcharts and pseudocode

AC9TDI10P05   

Design algorithms involving logical operators and represent them as flowcharts and pseudocode

Keywords Computational Thinking, Sequences, Patterns, Symbols, Finite-state automata
Organisation

University of Canterbury, New Zealand

Copyright

Creative Commons BY-NC-SA 4.0