CSE 318 Automata and Formal Grammars (3)
Instructor: H. Munoz-Avila
Current Catalog Description
The courses study foundation aspects of computation. The course covers three kinds of automata: include Finite Automata, Pushdown Automata and Turing Machines. It also covers the languages that these automata compute: regular languages, context-free languages, and decidable languages. The concepts of decidable and semi-decidable problems are also introduced.
Textbook
Efim Kimber, Carl Smith, Theory of Computation - A Gentle Introduction, ISBN 0130279617, Prentice Hall.
References
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ulman. Introduction to Automata Theory, Languages and Computation.
Course Goals
Teach students theory of computing. Study the capabilities and limitations of different kinds of automata including Turing-based models (today’s computers).
Prerequisites by Topic
CSE 261 Discrete Math.
Major Topics Covered in the Course
Automata
Finite Automata
Pushdown Automata
Turing Machines
Formal languages:
regular languages
context-free languages
decidable languages.
Laboratory projects (specify number of weeks on each)
none
Estimate CSAB Category Content
CORE ADVANCED
Data Structures
Computer Organization and Architecture
Algorithms Software Design 1
Concepts of Programming Languages
Oral and Written Communications
(does not apply - students have a weekly homework and students present their solutions in class)
Every student is required to submit at least _____ written reports (not including exams, tests, quizzes, or commented programs) of typically _____ pages and to make _____ oral presentations of typically _____ minutes duration. Include only material that is graded for grammar, spelling, style, and so forth, as well as for technical content, completeness, and accuracy.
Social and Ethical Issues
(does not apply)
Theoretical Content
This course is 100% theoretical content.
Problem Analysis
Solution Design
COLLEGE HOME | LEHIGH HOME | SEARCH
