CSCI4011: Formal Languages and Automata Theory

4 Credits

Logical/mathematical foundations of computer science. Formal languages, their correspondence to machine models. Lexical analysis, string matching, parsing. Decidability, undecidability, limits of computability. Computational complexity.prereq: 2041 or instr consent

View on University Catalog

All Instructors

B Average (3.134)Most Common: A (18%)

This total also includes data from semesters with unknown instructors.

1467 students
SNWFDCBA

  • 3.89

    /5

    Recommend

  • 3.31

    /5

    Effort

  • 4.29

    /5

    Understanding

  • 3.73

    /5

    Interesting

  • 3.46

    /5

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Spring 2024 provided by the Office of Institutional Data and Research

      Privacy Policy