CS Unplugged: Field guide: Formal Languages

An online resource for teaching Computer Science to students, this chapter focusses on Formal Languages. This chapter covers the strict rules specified in formal languages and describes examples of its use. Find out about regular expressions including an example, Finite state automata.

Additional details

Year band(s) 9-10
Format Web page
Core and overarching concepts Implementation (programming), Digital systems, Data representation, Algorithms
Australian Curriculum Digital Technologies code(s)

Model and query entities and their relationships using structured data


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


Validate algorithms and programs by comparing their output against a range of test cases


Implement, modify and debug modular programs, applying selected algorithms and data structures, including in an object-oriented programming language

Technologies & Programming Language​s other programming languages
Keywords Formal Languages, Regular expressions, Finite state automata, Grammars, Parsing, Chomsky Hierarchy

University of Canterbury, New Zealand


University of Canterbury, New Zealand. Creative Commons BY-NC-SA 4.0.