|
Nov 24, 2024
|
|
|
|
COMPSCI 2AC3 - Automata and Computability 3 unit(s)
Finite state machines, regular languages, regular expressions, applications of regular languages, grammars, context-free languages, models of computation, computability and decidability. Three lectures, one tutorial (two hours); second term Prerequisite(s): COMPSCI 2LC3, 2C03 Antirequisite(s): COMPSCI 2FA3, 2MJ3, SFWRENG 2FA3 First offered 2021-2022.
Add to Favourites (opens a new window)
|
|