Skip to main content
Skip to main menu

Slideshow

CSCI 6610

Automata and Formal Languages

The fundamental limitations on mechanized computation. In the first part of the course, the emphasis is on possible versus impossible computations. Three classes of languages are considered: regular, context-free, and recursively enumerable. In the second part of the course the emphasis shifts to possible versus feasible computations.

Prerequisites:
http://bulletin.uga.edu/CoursesHome.aspx

Semester Offered:
Spring

Support us

We appreciate your financial support. Your gift is important to us and helps support critical opportunities for students and faculty alike, including lectures, travel support, and any number of educational events that augment the classroom experience. Click here to learn more about giving.

Every dollar given has a direct impact upon our students and faculty.