Scribd
Upload
30 views

Comp 11

Uploaded by

jeriko pelimiano
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views

Comp 11

Uploaded by

jeriko pelimiano
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

MALLIG PLAINS COLLEGES

Casili, Mallig, Isabela

COLLEGE OF INFORMATION TECHNOLOGY EDUCATION

SYLLABUS
School Year 2013-2014

Course No.: Comp 11 No. of Units: 3 Time: Days:


Course & Year: BSCS 2 Building & Room No.: Consultation Hours:
Descriptive Title: Automata and Language Theory
Course Objectives:
 understand the principal models of computation such as finite automata, pushdown automata and Turing machines
 recognize the correspondence of the different language classes to the models of computation

Objectives & Classification Learning Strategies and Expected Outcomes and/or


Topics & Time Allotment
Levels Assessment Activities Results
Orientation Internalize the meaning and Discussion Sincerity
MPC – Philosophy, Mission, the message of the MPC and Group Loyalty
Vision & Objectives ICS Dept PVMO Buzzing Obedience
ICS Dept - Mission, Vision &
Objectives
(1hr)
PRELIMINARIES - Understand grammars (G), Lecture Clear knowledge and
Languages (L), and Automata Recitation/ Board Work application of basic concept
1.1 Strings, Alphabets, and (M). Group Activity about automata
Languages - Understand properties of Library Work
1.2 Graphs and Tree sets, relations and Assignment
1.3 Inductive proofs mathematical inductions. Seatwork
1.4 Set Notations Knowledge (C1), Quiz
1.5 Relations (16hrs) Comprehension (C2),
Application (C3), Analysis
(C4), Organization (A4)
FINITE AUTOMATA AND - Knows the definitions for Clear knowledge and
REGULAR EXPRESSIONS regular grammars/languages application of finite automata
& finite automata and regular expressions
2.1 Finite State Systems Knowledge (C1),
2.2 Basic Definitions Comprehension (C2),
2.3 Non deterministic finite Application (C3), Analysis
automata (C4), Organization (A4)
2.4 Finite automata with € -
moves
2.5 Regular expressions
2.6 Two-way Finite automata
2.7 Finite automata with
output
2.8 Applications of finite
automata

OPERATION ON - Be familiar with properties Clear knowledge and


LANGUAGES and operations on languages application of operation on
Knowledge (C1), languages
3.1 Union Comprehension (C2),
3.2 Concatenation Application (C3), Analysis
3.3 Kleene Closure (C4), Organization (A4)
PRELIM EXAMINATION
- Knows how to design a Lecture Clear knowledge and
PUSHDOWN AUTOMATA pushdown automaton to Recitation/ Board Work application of pushdown
accept context-free L Group Activity automata
5.1 Informal description Knowledge (C1), Library Work
5.2 Definitions Comprehension (C2), Assignment
5.3 Pushdown automata and Application (C3), Analysis Seatwork
context-free languages (C4), Organization (A4) Quiz

- Identify the properties of Clear knowledge and


PROPERTIES OF context-free languages application of properties of
CONTEXT-FREE Knowledge (C1), context-free languages
LANGUAGES Comprehension (C2),
Application (C3), Analysis
6.1 The pumping lemma for (C4), Organization (A4)
CFL’s
6.2 Closure properties of
CFL’s
6.3 Decision algorithm for
CFL’s

MIDTERM EXAMINATION
TURING MACHINES - Knows how to design a Lecture Clear knowledge and
Turing machine to accept any Recitation/ Board Work application of turing machines
7.1 Introduction language Group Activity
7.2 The Turing Machine Knowledge (C), Library Work
Model Comprehension (C2), Assignment
7.3 Computable languages Application (C3), Analysis Seatwork
and functions (C4), Organization (A4) Quiz
7.4 Techniques for Turing
machines construction
7.5 Modifications of Turing
machine
7.6 Church’s hypothesis
7.7 Turing machines as
enumerators
7.8 Restricted Turing
machines equivalent to the
basic model
(16hrs)
FINAL EXAMINATION

Course Requirements:
1. Major Examinations
2. Attendance
3. Quizzes
4. Projects
5. Participation in the class discussion
Grading System:
ClassStanding = 90%(Quiz+Recitation+Assignment+Project) + 10%(Attendance)
PrelimGrade = 2/3ClassStanding + 1/3PrelimExam
MidTermGrade = 2/3 PrelimGrade + 1/3MidTermTentativeGrade
FinalGrade = 2/3 PrelimGrade + 1/3FinalTentativeGrade
References:
Books
1. Linz, P., Introduction to Formal Languages and Automata (3rd ed.), 2000
2. Hopcroft, John E., & Ullman, Jeffrey, D., Introduction to AutomataTheory, Languages and Computation, 1997
3. Barlett, Jones, & Sipser, Michael, Introduction to the Theory of Computation (1 st ed.),1997

Websites
1. http://xml.cs.nccu.edu.tw/courses/Flang/FL2011/lecture-notes.html
2. http://infolab.stanford.edu/~ullman/ialc.html
3. http://forum.jntuworld.com/showthread.php?6381-Formal-Languages-and-Automata-Theory-%28FLAT%29-Notes

Online Journals
1. http://www.jalc.de/
2. http://www.journals.elsevier.com/theoretical-computer-science/

Prepared by: Noted by:

JERIKO G. PELIMIANO DRYMLAD A. REBAJA GEORGE A. BORROMEO, MIT


Instructor Instructor Dean

You might also like