Theory of Computation (MAE745): Διαφορά μεταξύ των αναθεωρήσεων
(Νέα σελίδα με '=== General === {| class="wikitable" |- ! School | School of Science |- ! Academic Unit | Department of Mathematics |- ! Level of Studies | Undergraduate |- ! Course Code | MAE745 |- ! Semester | 7 |- ! Course Title | Automata Theory and Formal Languages |- ! Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 6) |- ! Course Type | Special Background |- ! Prerequisite Courses | - |- ! Language of Instruction and Examinations | Greek |- !...') |
Χωρίς σύνοψη επεξεργασίας |
||
(14 ενδιάμεσες αναθεωρήσεις από τον ίδιο χρήστη δεν εμφανίζεται) | |||
Γραμμή 1: | Γραμμή 1: | ||
* [[Θεωρία Υπολογισμού (MAE745)|Ελληνική Έκδοση]] | |||
{{Course-UnderGraduate-Top-EN}} | |||
{{Menu-OnAllPages-EN}} | |||
=== General === | === General === | ||
{| class="wikitable" | {| class="wikitable" | ||
Γραμμή 24: | Γραμμή 28: | ||
! Course Title | ! Course Title | ||
| | | | ||
Theory of Computation | |||
|- | |- | ||
! Independent Teaching Activities | ! Independent Teaching Activities | ||
Γραμμή 46: | Γραμμή 50: | ||
|- | |- | ||
! Course Website (URL) | ! Course Website (URL) | ||
| | | See [https://ecourse.uoi.gr/ eCourse], the Learning Management System maintained by the University of Ioannina. | ||
|} | |} | ||
Γραμμή 55: | Γραμμή 59: | ||
! Learning outcomes | ! Learning outcomes | ||
| | | | ||
The goal of this course is the deeper understanding of Automata Theory and Languages. During the course a detailed examination of the following topics are done: | The goal of this course is the deeper understanding of Automata Theory and Languages. During the course a detailed examination of the following topics are done: | ||
* Introductory concepts of Automata , Computability and Complexity as well as basic definitions, basic theorems and inductive proofs | * Introductory concepts of Automata , Computability and Complexity as well as basic definitions, basic theorems and inductive proofs | ||
Γραμμή 63: | Γραμμή 66: | ||
* Introduction of Turing Machines. Standard TM, useful techniques for TM constructions. Modification of TM. TM as procedure. | * Introduction of Turing Machines. Standard TM, useful techniques for TM constructions. Modification of TM. TM as procedure. | ||
* Unsolvability. The Church-Turing Thesis. The Universal TM. The Halting Problem for TM. Computational Complexity. NP-complete problems. | * Unsolvability. The Church-Turing Thesis. The Universal TM. The Halting Problem for TM. Computational Complexity. NP-complete problems. | ||
Upon completion of the course, the students will be able to: | |||
* understand theoretical documentation of mathematical problems | |||
* solve exercises | |||
* track further applications | |||
which related to Finite Automata, Pushdown Automata, and Turing Machines as well as to Unsolvability , to Computational Complexity and to NP-complete problems. | which are related to Finite Automata, Pushdown Automata, and Turing Machines as well as to Unsolvability , to Computational Complexity and to NP-complete problems. | ||
|- | |- | ||
! General Competences | ! General Competences | ||
Γραμμή 75: | Γραμμή 78: | ||
* Implementation- Consolidation | * Implementation- Consolidation | ||
|} | |} | ||
=== Syllabus === | === Syllabus === | ||
* | |||
* Finite | * Introduction and related concepts. | ||
* | * Finite automata and regular expressions, regular languages, closure properties, pumping lemma, algorithms. | ||
* Determinism, non-determinism. | |||
* | * Pushdown automata and context-free grammars, context-free languages, closure properties, pumping lemma, algorithms. | ||
* | * Chomsky normal form. | ||
* Turing machines, equivalence of different models. | |||
* Recursive and recursively enumerable languages. | |||
* Church-Turing thesis. | |||
* Undecidability, the halting problem, Post’s correspondence problem. | |||
* Classes P and NP. | |||
=== Teaching and Learning Methods - Evaluation === | === Teaching and Learning Methods - Evaluation === | ||
{| class="wikitable" | {| class="wikitable" | ||
Γραμμή 90: | Γραμμή 100: | ||
|- | |- | ||
! Use of Information and Communications Technology | ! Use of Information and Communications Technology | ||
| | | | ||
* Projector and interactive board during lectures. | |||
* Course website maintenance. | |||
* Announcements and posting of teaching material (lecture slides and notes, programs). | |||
* Assessment marks via the ecourse platform. | |||
|- | |- | ||
! Teaching Methods | ! Teaching Methods | ||
Γραμμή 113: | Γραμμή 127: | ||
! Student Performance Evaluation | ! Student Performance Evaluation | ||
| | | | ||
Final | Final test | ||
|} | |} | ||
=== Attached Bibliography === | === Attached Bibliography === | ||
<!-- In order to edit the bibliography, visit the webpage --> | |||
<!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF:MAE745-Biblio --> | |||
See the official [https://service.eudoxus.gr/public/departments#20 Eudoxus site] or the [https://cloud.math.uoi.gr/index.php/s/62t8WPCwEXJK7oL local repository] of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Books and other resources, not provided by Eudoxus: | |||
{{MAE745-Biblio}} |
Τελευταία αναθεώρηση της 12:36, 15 Ιουνίου 2023
- Ελληνική Έκδοση
- Undergraduate Courses Outlines
- Outline Modification (available only for faculty members)
- Department of Mathematics
- Save as PDF or Print (to save as PDF, pick the corresponding option from the list of printers, located in the window which will popup)
General
School |
School of Science |
---|---|
Academic Unit |
Department of Mathematics |
Level of Studies |
Undergraduate |
Course Code |
MAE745 |
Semester |
7 |
Course Title |
Theory of Computation |
Independent Teaching Activities |
Lectures (Weekly Teaching Hours: 3, Credits: 6) |
Course Type |
Special Background |
Prerequisite Courses | - |
Language of Instruction and Examinations |
Greek |
Is the Course Offered to Erasmus Students |
Yes (in English) |
Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
Learning outcomes |
The goal of this course is the deeper understanding of Automata Theory and Languages. During the course a detailed examination of the following topics are done:
Upon completion of the course, the students will be able to:
which are related to Finite Automata, Pushdown Automata, and Turing Machines as well as to Unsolvability , to Computational Complexity and to NP-complete problems. |
---|---|
General Competences |
|
Syllabus
- Introduction and related concepts.
- Finite automata and regular expressions, regular languages, closure properties, pumping lemma, algorithms.
- Determinism, non-determinism.
- Pushdown automata and context-free grammars, context-free languages, closure properties, pumping lemma, algorithms.
- Chomsky normal form.
- Turing machines, equivalence of different models.
- Recursive and recursively enumerable languages.
- Church-Turing thesis.
- Undecidability, the halting problem, Post’s correspondence problem.
- Classes P and NP.
Teaching and Learning Methods - Evaluation
Delivery |
Face to face | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology |
| ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
Final test |
Attached Bibliography
See the official Eudoxus site or the local repository of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Books and other resources, not provided by Eudoxus:
- [11776]: Στοιχεία θεωρίας υπολογισμού, Lewis Harry R.,Παπαδημητρίου Χρίστος Χ.
- [257]: ΕΙΣΑΓΩΓΗ ΣΤΗ ΘΕΩΡΙΑ ΥΠΟΛΟΓΙΣΜΟΥ, SIPSER MICHAEL.