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) 3-4, 5-6, 7-8, 9-10
Format Web page
Core and overarching concepts Implementation (programming)
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.