CS 475

spring 2022

All Classes

Formal Models of Computation

Credit: 3 OR 4 hours.

Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity.

Same as MATH 475. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 374.

Status Icon Legend

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- CS 101
- CS 102
- CS 105
- CS 107
- CS 124
- CS 126
- CS 128
- CS 173
- CS 199
- CS 210
- CS 211
- CS 222
- CS 225
- CS 233
- CS 240
- CS 241
- CS 307
- CS 357
- CS 361
- CS 374
- CS 397
- CS 402
- CS 403
- CS 411
- CS 412
- CS 413
- CS 418
- CS 420
- CS 421
- CS 422
- CS 425
- CS 431
- CS 433
- CS 437
- CS 438
- CS 439
- CS 440
- CS 441
- CS 442
- CS 444
- CS 445
- CS 446
- CS 450
- CS 461
- CS 464
- CS 466
- CS 468
- CS 473
- CS 475
- CS 482
- CS 484
- CS 491
- CS 493
- CS 494
- CS 497
- CS 498
- CS 499
- CS 500
- CS 510
- CS 521
- CS 526
- CS 533
- CS 534
- CS 555
- CS 565
- CS 574
- CS 575
- CS 586
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor