CS 475

fall 2004

All Classes

Formal Models of Computation

Credit: 3 OR 4 hours.

(C S 375) 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 273 or consent of instructor.

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 100
- CS 101
- CS 105
- CS 125
- CS 173
- CS 196
- CS 199
- CS 210
- CS 225
- CS 231
- CS 232
- CS 257
- CS 273
- CS 296
- CS 397
- CS 400
- CS 411
- CS 413
- CS 418
- CS 421
- CS 422
- CS 423
- CS 425
- CS 427
- CS 431
- CS 433
- CS 435
- CS 438
- CS 440
- CS 443
- CS 450
- CS 458
- CS 473
- CS 475
- CS 491
- CS 492
- CS 498
- CS 499
- CS 523
- CS 524
- CS 526
- CS 527
- CS 541
- CS 543
- CS 545
- CS 571
- CS 575
- CS 577
- CS 578
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor