CS 475
fall 2023
All Classes
Formal Models of Computation
| Course | Section | CRN | Date | Day | Start Time | End Time | Room | Exam Type |
|---|
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 or ECE 374.
- 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 107
- CS 124
- CS 128
- CS 173
- CS 199
- CS 210
- CS 211
- CS 222
- CS 225
- CS 233
- CS 265
- CS 307
- CS 340
- CS 341
- CS 357
- CS 361
- CS 374
- CS 397
- CS 400
- CS 401
- CS 407
- CS 409
- CS 410
- CS 411
- CS 412
- CS 413
- CS 415
- CS 418
- CS 421
- CS 422
- CS 423
- CS 424
- CS 425
- CS 426
- CS 427
- CS 433
- CS 437
- CS 438
- CS 439
- CS 440
- CS 441
- CS 442
- CS 444
- CS 445
- CS 446
- CS 447
- CS 450
- CS 460
- CS 461
- CS 465
- CS 466
- CS 468
- CS 473
- CS 475
- CS 476
- CS 481
- CS 483
- CS 491
- CS 492
- CS 497
- CS 498
- CS 499
- CS 500
- CS 511
- CS 512
- CS 514
- CS 521
- CS 527
- CS 537
- CS 542
- CS 543
- CS 545
- CS 546
- CS 549
- CS 554
- CS 562
- CS 563
- CS 567
- CS 572
- CS 579
- CS 580
- CS 581
- CS 591
- CS 597
- CS 598
- CS 599
×
STATUS ICON LEGEND
"/> Section is Open
"/> Section is Open with Restrictions
"/> Section is Closed
"/> Section is Pending
"/> Section is availability is unknown
| Detail | Status | CRN | Type | Section | Time | Day | Location | Instructor |
|---|