back to search
In 3 fellow students' timetables
You learn how different classes of automata (finite, deterministic, nondeterministic, Büchi automata) are used as data structures for the representation and manipulation of (also infinite) sets and relations. You practice building and composing automata, automatic operations (e.g., boolean operations, joins) and the connection between automata and logic as well as their application in pattern matching, program verification and in problems such as Diophantine equations.
From the current semester, not binding.
No ratings for this module yet.
Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.
Reviews are automatically checked before they are published.
Official page in TUMonline · Details are not binding.