CS 6861
Last Updated
- Schedule of Classes - June 11, 2025 2:48PM EDT
Classes
CS 6861
Course Description
Course information provided by the 2025-2026 Catalog.
Kleene algebra is the algebra of regular expressions and finite automata, structures of fundamental importance in computer science. Kleene algebra is the algebraic theory of these objects, although it has many other natural and useful interpretations: relational algebra, programming language semantics, program logics, automata and formal languages, network programming, computational geometry, and the design and analysis of algorithms. In this course we will explore the theory and applications of this system, including models, deductive systems, completeness and complexity results, and applications in the areas mentioned above. A final paper or project will be due on which the course grade will be based. It will be either an independent study with a final paper and presentation, or a software project and presentation, at the students' choice.
Last 3 terms offered 2024SP, 2019FA, 2018SP
Regular Academic Session. Choose one lecture and one project.
-
Credits and Grading Basis
4 Credits Opt NoAud(Letter or S/U grades (no audit))
-
Class Number & Section Details
-
Meeting Pattern
- MW
- Aug 25 - Dec 8, 2025
Instructors
Silva, A
-
Additional Information
Instruction Mode: In Person
For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/
Share
Disabled for this roster.