This course introduces automata theory, formal languages and computability. Topics include: finite automata; regular expressions; regular, context-free, and context-sensitive languages; computability models; algorithmic decidable and undecidable problems. Three lecture hours per week. 04-09-2024-04-12-2024 Lecture Monday, Wednesday, Friday 09:30AM - 10:20AM, Health Sciences Bldg, Room 104
- Teacher: Cezar Campeanu