Voorkennis - Automaten en Talen

Share:

Listens: 0

Berekenbaarheidstheorie

Education


TI2320 (IN2505-II). Berekenbaarheidstheorie. "This module captures some important preliminaries to the course. These include the notions of deterministic and non-deterministic finite state automata, regular languages, grammars, context-free grammars, context-free languages and Chomsky normal form."