Course Overview

Learning objectives:

- Become familiar with basic concepts of Formal Language Theory
- Explain and manipulate the different concepts in automata theory
and formal languages

Skills and abilities:

- Design automata or regular expressions for simple languages
- Determine if a certain word belongs to a language
- Describe the language accepted by an automata or generated by a
regular expression
- Transform between equivalent deterministic and nondeterministic
finite automata, and regular expressions

Learning Achievement

Competence

Course prerequisites

Grading Philosophy

- Written exam, duration of 1.5hr (50%)
- Continuous assessment (50%)

Course schedule

- Alphabets, words and languages - Regular expressions and regular
languages - Deterministic finite automata (DFA) - Nondeterministic
finite automata (NFA) - Kleene’s Theorem - From NFA to DFA -
Minimisation of automata

Course type

In-class: lectures, tutorials (16h) Homework (16h)

Online Course Requirement

Instructor

Other information

Duration: 6 weeks
Study level: University Diploma in Technology
Language of instruction: English
Mode of delivery: In-class: lectures and tutorials

Site for Inquiry