Browsing Mathematics (18)  Archived by Subject "regular languages"
Now showing items 12 of 2

6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002
(200206)Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite representation of infinite objects. Finite automata and regular languages. Contextfree languages. Turing machines. Partial ... 
6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005
(200506)This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: ...