CSE 473

/CSE 573. Automata, Formal Languages, and Computability

Miami University · UGRD · Fall 2026

1 section

Catalog description

Regular expressions. Closure properties. Sequential machines and finite state transducers. State minimization. Chomsky hierarchy grammars, pushdown acceptors and linear bounded automata. Closure properties of algorithms on grammars. Turing machine as acceptor and transducer. Universal machine. Computable and noncomputable functions. Halting problem. Prerequisite: CSE 274 or equivalent and ( MTH 231 or MTH 331 ).

Sections

Current meeting, instructor, credit, and enrollment details

Updated 5 hours ago

001

Availability not recently verified

Class #miami_oxford-CSE473Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?