Beruflich Dokumente
Kultur Dokumente
Course Outcomes:
Books:
REFERENCES:
Collaboration and group work is encouraged but each student is required to submit his/her own contribution(s). Your writings must be your own thoughts. Cheating and plagiarism will not be tolerated and will be referred to the Dean for appropriate action(s).
Quiz/Assignments Policy
Quizzes: Quizzes will be unannounced some time, but tentative plan of quizzes is given in the outline. They will be taken either in the first ten minutes of the class (so come to the class on time & be prepared!) or in the last ten minutes of the class (so listen to the lecture carefully). If you miss a quiz, you miss it! Its up to the instructors discretion to choose the number of quizzes for evaluation purposes.
Assignments: Tentative number of Assignments is given in the outlines. Assignments will be submitted on time. You will have 10 hours to submit the assignment after the due date & time. However, 10% marks will be deducted for every passing hour after the due time. Copying/Cheating whole or part of the assignment from anywhere without proper credit/references will not be tolerated. Whether you have copied or your work has been copied by someone else, you will get zero marks in that assignment. Project Work
Students will be given a practical nature problem and at the end, each group will make a presentation of his/her work and/or give a demo of the project.
Week # 01 Introduction to Automata Review of proof techniques Introduction to Automata Introduction to Formal Languages Alphabet sets and Languages Finite and Infinite Languages Kleen Closure and Positive Closure Recursive Definitions
Week # 02: Finite Automata Finite State Automata Deterministic Finite State Automata (DFA) Non Deterministic Finite State Automata (NFA) Week 03: (Quiz 01, Assignment 01) Finite Automata Equivalence of NFA and DFA Epsilon NFA Regular Expressions & Languages Regular expressions Week # 04 Regular Expressions & Languages Regular Grammars Finite Automata and Regular Expressions Week # 05 (Quiz 02, Assignment 02) Properties of Regular Languages Algorithms for Regular Languages Week 06: Properties of Regular Languages Algorithms for Regular Languages Finite Automata with output Moore Machines/Mealy Machines Week 07: (Quiz 03, Assignment 03) Regular Languages Regular and Non regular Languages Decidability Context-free Languages (CFL) Context-free grammars (CFG) Week # 08: Context-free Languages (CFL) Parse Trees Derivations and ambiguity Week # 09 & 10: Mid Term