CSA 473 /573 - Automata,Formal Languages,and Computability

Institution:

Miami University-Oxford

Subject:

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: CSA 274 or equivalent and MTH 231 or discrete math.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.miami.miamioh.edu

Phone Number:

(513) 529-1809

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.