CSE 350 - Course Objectives

• Introduce abstract models of computation such as finite and push-down automata, and analyze their relative expressive power.
• Explore the connection between abstract machine models and formal languages, as specified by grammars.
• Enhance students awareness of both the power and inherent limitations of algorithmic computation via the study of Turing machines and/or other abstract computational models.
• Enable students to apply languages and automata to solve problems in applied computer science.