CS 150: The Theory of Automata and Formal Languages

← 2008-09 2009-10 2010-11 →
← 2008-09 changes (lax) changes (strict) ▾ 2011-12 → 2010-11 →

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 201

Prerequisites: CS 014; CS 111/MATH 111; MATH 009C or MATH 09HC

Description: A study of formal languages, including regular and context-free languages; compu- tational models for generating these languages such as finite-state automata, pushdown automata, regular expressions, and context-free grammars; mathematical properties of the languages and models; equivalence between the models, and an introduction to Turing machines and decidability.

Derived Information — The following is not part of the official catalog but is computed from catalog data.

Serves as a prerequisite for

CS 151 CS 152 CS 181 CS 206 CS 215 CS 246 PHIL 124
Prerequisite graph not available.

Referenced in

Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2025-26  61/150 102/115  68/100 30/30 261/395
2024-25  42/150 163/165  81/150 20/30 306/495
2023-24 136/150 156/158  84/150 30/30 406/488
2022-23 148/150 149/150 147/150 444/450
2021-22 113/120 117/122 131/136 361/378
2020-21  99/110 117/122  72/ 75 30/30 318/337
2019-20 109/110  96/105  63/ 73 268/288
2018-19  80/105  81/104  63/ 70 224/279
2017-18 101/104  70/ 70 171/174
2016-17  97/120  85/ 85 182/205