Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Course Outline

    Uploaded by

    alihamza
    This document provides information about the CS301 Theory of Automata course offered at National University of Computer and Emerging Sciences, Lahore. The course is a 3 credit core course taught by Dr. Khawaja Muhammad Fahd. It introduces students to the theory of computation including finite automata, regular languages, context-free languages, and Turing machines. Students will learn about different types of automata and their ability to recognize languages. Grading will be based on quizzes, assignments, midterm exams, and a final exam. The course policies outline expectations for attendance, assignments, exams, and academic integrity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Course Outline

    Uploaded by

    alihamza
    23 views3 pages
    This document provides information about the CS301 Theory of Automata course offered at National University of Computer and Emerging Sciences, Lahore. The course is a 3 credit core course taught by Dr. Khawaja Muhammad Fahd. It introduces students to the theory of computation including finite automata, regular languages, context-free languages, and Turing machines. Students will learn about different types of automata and their ability to recognize languages. Grading will be based on quizzes, assignments, midterm exams, and a final exam. The course policies outline expectations for attendance, assignments, exams, and academic integrity.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information about the CS301 Theory of Automata course offered at National University of Computer and Emerging Sciences, Lahore. The course is a 3 credit core course taught by Dr. Khawaja Muhammad Fahd. It introduces students to the theory of computation including finite automata, regular languages, context-free languages, and Turing machines. Students will learn about different types of automata and their ability to recognize languages. Grading will be based on quizzes, assignments, midterm exams, and a final exam. The course policies outline expectations for attendance, assignments, exams, and academic integrity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views3 pages

    Course Outline

    Uploaded by

    alihamza
    This document provides information about the CS301 Theory of Automata course offered at National University of Computer and Emerging Sciences, Lahore. The course is a 3 credit core course taught by Dr. Khawaja Muhammad Fahd. It introduces students to the theory of computation including finite automata, regular languages, context-free languages, and Turing machines. Students will learn about different types of automata and their ability to recognize languages. Grading will be based on quizzes, assignments, midterm exams, and a final exam. The course policies outline expectations for attendance, assignments, exams, and academic integrity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    NATIONAL UNIVERSITY

    of Computer & Emerging Sciences, Lahore

    FAST School of Computing


    CS301 – Theory of Automata
    FALL 2020
    Instructor Name: Dr. Khawaja Muhammad Fahd TA Name: TBA
    Email address: [email protected] Email address: TBA
    Office Location/Number: TBA Office Location: TBA
    Office Hours: TBA Office Hours: TBA

    Course Information
    Program: BS (CS)
    Credit Hours: 3
    Type: Core
    Pre-requisite: CS211-Discrete Structures
    Course Website: Google Classroom and SLATE
    Class Meeting Time: 8 AM (5E), 9:30 AM (5F), Mondays and Wednesdays
    Class Venue: CS-7

    Course Description/Objectives/Goals
    This core course belongs to an important branch of computer science known as Theoretical
    Computer Science (TCS). TCS deals with, among other concepts, the theory of computation which
    focuses on automata theory, computability theory, and complexity theory. Students are gradually
    familiarized with different types of increasingly more powerful mathematical models of computers
    known as automata (plural of automaton) and the languages they can recognize.

    Course Learning Outcomes (CLOs)


    At the end of the course, students will be able to:
    understand the main concepts of automata theory using rigorously formal mathematical methods
    appreciate the differencebetween various classes of automata, languages, and grammars
    analyze and design different types of automata, REs, and CFGs
    transform between equivalent NFAs, DFAs and REs
    define Turing machines capable of performing simple tasks.

    Textbook and Reference Book


    1. Introduction to the Theory of Computation, Michael Sipser, 3rdEdition, Cengage Learning,
    2012.
    2. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev
    Motwani, and Jeffrey D. Ullman, 3rdEdition, Pearson, 2006.

    Tentative Weekly Schedule


    Page 1 of 3
    Week Topics Readings
    1 Introduction and Revision of Basic Concepts [1] Chapter 0
    2 Finite Automata: DFA [1] Chapter 1
    3 Finite Automata: NFA [1] Chapter 1
    4 Finite Automata: NFA-DFA Conversion [1] Chapter 1
    5 Regular Languages: Regular Expressions, [1] Chapter 1
    Equivalence with FA (Kleene’s Theorem)
    6 MIDTERM EXAM 1
    6 Regular Languages: Pumping Lemma [1] Chapter 1
    7 Context-Free Languages: CFGs [1] Chapter 2
    8 Context-Free Languages: PDA [1] Chapter 2
    9 Context-Free Languages: PDA-CFG [1] Chapter 2
    Equivalence
    10 Context-Free Languages: Pumping Lemma [1] Chapter 2
    11, 12 Context-Free Languages: DCFLs [1] Chapter 2
    12 MIDTERM EXAM 2
    13 Turing Machines: Introduction [1] Chapter 3
    14 Turing Machines: Variants [1] Chapter 3
    15, 16 Decidability and Other Advanced Topics [1] Chapter 4

    Page 2 of 3
    (Tentative) Grading
    1. Quizzes (20%)
    2. Assignments (10%)
    3. Midterm Exams (30%)
    4. Final Exam (40%)

    Grading Scheme: Absolute

    Course Policies
    1. Announcements related to different aspects of this course (e.g. lectures, quizzes, exams,
    etc.) may be posted on SLATE (http://slate.nu.edu.pk/portal) and/or Google Classroom.
    Students are expected to view the announcements section of SLATE and Google Classroom
    Stream regularly.
    2. All students are expected to attend all lectures from beginning to end. Partial or full absence
    from a lecture without a valid reason may hamper chances for securing good grades.
    University’s attendance requirements must be met in order to appear in the final exam.
    3. Exams will be closed-book and closed-notes. Syllabus for the final exam will be
    comprehensive.
    4. Late submission of assignments is NOT allowed.
    5. Students are encouraged to take full advantage of instructor’s office hours. Any doubts
    regarding concepts covered in class or any questions regarding quizzes, assignments, etc.
    may be clarified during office hours. In case a student is not able to make it during office
    hours, he/she may schedule an appointment with the instructor for another time slot.
    6. Quizzes may be announced or unannounced. A quiz will usually be about 5 – 15 minutes long
    and it may be given anytime during the lecture. Students missing a quiz will NOT be given a
    make-up quiz.
    7. Students are encouraged to finish the assigned readings BEFORE the lecture. This is likely to
    improve lecture comprehension and class participation.
    8. Students can contest their grades on quizzes and assignments ONLY within a week of the
    release of grades. Exams will be available for review according to university policies.
    9. Students are expected to demonstrate the highest degree of moral and ethical conduct. Any
    student caught cheating, copying, plagiarizing, or using any other unfair means will be
    strictly dealt-with in accordance with university policies.

    Page 3 of 3

    You might also like