CS375: Logic and Theory of Computing (Fall 2024)

Lecture Notes

• Preliminaries
• Regular Languages and Finite Automata-I
• Regular Languages and Finite Automata-II
• Regular Languages and Finite Automata-III
• Regular Languages and Finite Automata-IV


• Context-free Languages and Pushdown Automata-I
• Context-free Languages and Pushdown Automata-II
• Context-free Languages and Pushdown Automata-III
• Context-free Languages and Pushdown Automata-IV
• Context-free Languages and Pushdown Automata-V


• Turing Machines & Equivalent Models-I
• Turing Machines & Equivalent Models-II
• Turing Machines & Equivalent Models-III


(if time permits, then)
• Propositional Logic I
• Propositional Logic II
• Predicate Logic I
• Predicate Logic II
• Predicate Logic III
• Computational Logic I
• Computational Logic II
• Algebraic Structure

This is the home page of CS375:  Logic and Theory of Computing. 

Instructor:
Dr. Fuhua (Frank) Cheng
cheng@cs.uky.edu

In this course, the students will develop knowledge of a variety of mathematical tools for the design and analysis of algorithms and computer programs. They will learn about basic models of computation based on finite automata, grammars and Turing machines. Specific skills as outcomes of the course include: (1) A fluency in the elements of automata theory, regular grammars and regular expressions, and their uses; (2) An understanding of the relationship between formal models of computation and modern computers; (3) An understanding of the relevance of theory of computation to the computer science curriculum (4) An ability to apply knowledge of computing and mathematics appropriate to the discipline (5) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.  

The course syllabus is available in ppt format and HTML format.