CSE 5321
Transcript Abbreviation:
Automata Form Lang
Course Description:
Machine-based and grammatical models of computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines; non-determinism; Church?s Thesis; halting problem.
Course Levels:
Undergraduate (1000-5000 level)
Graduate
Designation:
Elective
General Education Course
(N/A)
Cross-Listings
(N/A)
Credit Hours (Minimum if “Range”selected):
2.00
Max Credit Hours
(N/A)
Select if Repeatable:
Off
Maximum Repeatable Credits
(N/A)
Total Completions Allowed
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes:
In Person (75-100% campus; 0-24% online)
Prerequisites and Co-requisites:
Prereq: 2231 or 321, and 2421 or 360, and 2331 or Math 566.
Electronically Enforced:
No
Exclusions:
Not open to students with credit for 3321 (625).
Course Goals / Objectives:
Be competent with using regular expressions and finite state machines
Be competent with using context-free languages, context-free grammars, and push-down automata
Be competent with proving by contradiction, by ordinary induction and by strong induction
Be familiar with non-determinism
Be familiar with Turing machines
Be exposed to reductions
Be exposed to decidability and recursive enumerability
Be exposed to Church?s Thesis
Be exposed to theory of parsing
Check if concurrence sought:
No
Contact Hours:
| Topic | LEC | REC | LAB | LAB Inst |
|---|---|---|---|---|
| Formal languages. | 3.0 | 0.0 | 0.0 | 0 |
| Regular languages and finite automata. | 15.0 | 0.0 | 0.0 | 0 |
| Grammars. | 3.0 | 0.0 | 0.0 | 0 |
| Context-free languages and pushdown automata. | 12.0 | 0.0 | 0.0 | 0 |
| Recursively enumerable languages and Turing machines. | 9.0 | 0.0 | 0.0 | 0 |
| Total | 42 | 0 | 0 | 0 |
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| Homework | 20% |
| Classroom participation | 10% |
| Midterms, final | 70% |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| Introduction to Languages and the Theory of Computation | J. C. Martin |
ABET-CAC Criterion 3 Outcomes:
| Outcome | Contribution | Description |
|---|---|---|
| 1 | Significant contribution (7+ hours) | Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions. |
| 2 | Some contribution (1-2 hours) | Design, implement, and evaluate a computing-based solution to meet a given set of computing requirements in the context of the program’s discipline. |
| 4 | Some contribution (1-2 hours) | Recognize professional responsibilities and make informed judgments in computing practice based on legal and ethical principles |
| 6 | Some contribution (1-2 hours) | Apply computer science theory and software development fundamentals to produce computing-based solutions. |
ABET-ETAC Criterion 3 Outcomes
(N/A)
ABET-EAC Criterion 3 Outcomes:
| Outcome | Contribution | Description |
|---|---|---|
| 1 | Significant contribution (7+ hours) | an ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science, and mathematics |
| 2 | Some contribution (1-2 hours) | an ability to apply engineering design to produce solutions that meet specified needs with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors |
| 4 | Some contribution (1-2 hours) | an ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments, which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts |
| 7 | Substantial contribution (3-6 hours) | an ability to acquire and apply new knowledge as needed, using appropriate learning strategies |
Embedded Literacies Info
(N/A)
Attachments
(N/A)
Additional Notes or Comments
(N/A)