Introduction to Formal Languages and Automata Theory
Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisite: course 180. Designed for junior/senior Computer Science majors. Grammars, automata, and languages. Finite-state languages and finite-state automata. Context-free languages and pushdown story automata. Unrestricted rewriting systems, recursively enumerable and recursive languages, and Turing machines. Closure properties, pumping lemmas, and decision algorithms. Introduction to computability. Letter grading.
Review Summary
- Clarity
-
10.0 / 10
- Organization
-
8.3 / 10
- Time
-
10-15 hrs/week
- Overall
-
10.0 / 10
Reviews
I honestly really enjoyed the class! Professor Batista was a really great teacher, and I feel like the material was explained really well. The workload is also very manageable, however I did take it over the summer online as an 8-week course so that might change things. All of my homework assignments were graded on effort (if you completed it and it looked like you tried, you got full points) and there was also extra credit offered for every assignment. All of the exams were open book and online. Overall, I think this class was really fun and the prof gives you every opportunity to do well
Showing 1 review
Course
Grading Information
-
No group projects
-
Attendance not required
-
1 midterm
-
Finals week final
-
0% recommend the textbook
Previous Grades
Grade distributions not available.