Introduction - Winter 2012 Introduction to computation...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Winter 2012: Introduction to computation theory Dr. Muath Alzghool [email protected] gmail.com I. Theory of Automata II. Theory of Formal Languages III. Theory of Turing Machines 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Winter 2010: Introduction to computation theory Introduction to Computation Theory (3 credits) Regular languages, finite automata, transition graphs, Kleene's theorem. Finite automata with output. Context-free languages, derivation trees, normal form grammars, pumping lemma, pushdown automata, determinism. Decidability. Recursively enumerable languages, Turing machines, the halting problem. PROFESSOR: Dr. Muath Alzghool LECTURES: Mon, Wed, 8:00-9:30 MANUEL: Introduction to Computer Theory, Daniel Cohen, Wiley, 2 nd edition. Course notes will be available on the web page of the course: 2
Background image of page 2
Winter 2012: Introduction to Formal Languages Approximate Course Outline: 1. Introduction, Languages, Recursive Definitions, 2. Regular Expressions, Finite Automata, Transition Graphs. 3. Kleene's Theorem. 4. Nondeterministic Finite Automata , Finite Automata with Output, 5. MIDTERM 6. Regular Languages, Non-regular Languages, Decidability 7. Context-Free Grammars, Grammatical Format 8. Pushdown Automata 9. Context-Free Grammars = Pushdown Automata 10. Non-Context-Free Languages, Context-Free Languages 11. Decidability, Parsing, Turing Machines. 12. Recursively Enumerable Languages . 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Introduction to Formal Languages Evaluation 4 assignments, 10% Quizzes: 20% Midterm Exam: 30% Final Exam, 40% 4
Background image of page 4
Two basic questions: What is a computer good for? What can & can’t a computer compute? Why? Want precise answers: using formal models of computers/computation. Using precise, mathematical writing
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 26

Introduction - Winter 2012 Introduction to computation...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online