Академический Документы
Профессиональный Документы
Культура Документы
Website:
Counseling Hours:
Pre-requisites:
CS-335/708
Course
Description:
Course Objectives:
Course Outcomes:
The main goal of this design DFAs, PDAs for different languages
and having a taste of computational models. After studying
Regular languages and CFL, the student will be able to have
understanding about a basic compiler. The student will have
understanding of computational model with Random Access
Memory with reference of Turing Machine.
Books:
REQUIRED TEXTS:
Tentative Grading
Policy:
Plagiarism Policy:
Quiz/Assignments
Policy
Quizzes:
Assignments:
Lecture
Lect-1
Lect-2
Lect-1
2
Lect-2
3
Lect-1
Lect-2
4
Lect-1
Lect-2
5
Lect-1
Lect-2
6
Lect-1
Contents (Theory)
Introduction to Automata
Review of proof techniques
Introduction to Formal Proof
Introduction to Automata
Introduction to Automata
Language in Abstract
Introduction to Formal Languages
Alphabet sets and Languages
Introduction to Automata
A new method for defining Language
Finite and Infinite Languages
Structural Representation
Automata and Complexity
Introduction to Automata
Kleen Closure and Positive Closure
Unification
Recursive Definitions
Finite Automata
Finite State Automata
Even-Even Revisited
Deterministic Finite State Automata (DFA)
The Language of a DFA
Finite Automata
Non Deterministic Finite State Automata (NFA)
The extended Transition Function
The Language of NFA
Problems
Finite Automata
Designing DFAs
Equivalence of NFA and DFA
Problems
Finite Automata
Epsilon NFA
Equivalence of DFAs
Epsilon Closure
Transition Graphs
Relaxing the restriction on input
Generalized Transition Graph
Nondetrminism
Regular Expressions & Languages
Regular Grammars
Language associated with Regular Expression
Building Regular Expressions for regular languages
Regular Expressions & Languages
Finite Languages are Regular
Lect-2
Lect-1
Lect-2
Lect-1
Lect-2
Introducing Even-Even
Operators of Regular Expression
Precedence of operator of Regular Expression
Regular Expressions & Languages
Finite Automata and Regular Expressions
From DFA to Regular Expression
Converting Regular Expression to Automata
Properties of Regular Languages
Algorithms for Regular Languages
Proving a language not to be regular
Identification of nonregular Languages using pigeon hole principle
Properties of Regular Languages
Closure property of regular languages
Algorithms for Regular Languages
Complement of regular languages
Properties of Regular Languages
Intersection of regular languages
Finite Automata with output
Properties of Regular Languages
Moore Machines
Mealy Machines
Moore = Mealy
MID-TERM EXAMS
9
Lect-1
Lect-2
10
Lect-1
Lect-2
11
Lect-1
Lect-2
12
Lect-1
Regular Languages
Regular and Non regular Languages
Deciding whether language is regular or nonregular
Regular Languages
Decidability
Decidable Languages
Proof that every context free Languages are decidable
Regular Languages
Decidability ( Equivalence, Finiteness)
Problems
Push down automata (PDA)
Introduction
Defining PDA
Language accepted by PDA
Push down automata (PDA)
Deterministic PDAs
Regular Languages and Deterministic PDA.
DPDA and Context Free Languages
Push down automata (PDA)
DPDA and Context Free Languages
Non-Deterministic PDA
Problems
Context-free Languages (CFL)
Parse Trees
Lect-2
13
Lect-1
Lect-2
14
Lect-1
Lect-2
15
Lect-1
Lect-2
16
Lect-1
Lect-2
FINAL-TERM EXAMS