CSC448H1

UTSG

Formal Languages and Automata

Regular, deterministic, context free, context sensitive, and recursively enumerable languages via generative grammars and corresponding automata (finite state machines, push down machines, and Turing machines). Topics include complexity bounds for recognition, language decision problems and operations on languages. Ordinarily offered in years alternating with CSC438H1.

View full details on the UofT Academic Calendar
Prereq: CSC236H1/ CSC236H5/ CSCB36H3/ CSC240H1, CSC263H1/ CSC263H5/ CSCB63H3/ CSC265H1Breadth: Physical & Mathematical UniversesExcl: CSC448H5. NOTE: Students not enrolled in the Computer Science Major or Specialist program at A&S, UTM, or UTSC, or the Data Science Specialist at A&S, are limited to a maximum of 1.5 credits in 300-/400-level CSC/ECE courses.
Easy0%
Useful0%
0
comments
0
ratings

Course Info

DepartmentCSC
CampusUTSG (St. George)
Level400
Hours24L/12T
BreadthPhysical & Mathematical Universes
What do you think of CSC448H1?

Reviews

No reviews yet — be the first to share your experience.