Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY
1.0 Course Description

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

The course introduces the theory of computation through a set of abstract machines that serve as models for computation, finite automata, and push down automata, linear-bounded automata and Turing Machine- and examines the relationship between these automata and formal language. 2.0 Course Objectives At the end of the term, the student is expected to: a. be familiar with the theory of computation b. analyze problem & compute strategically by the use of automata and formal language 3.0 Grading System Average Quizzes Class Standing Major Examination GRADE Prelim 40% 10% 50% -------100% ===== Midterm 40% 10% 50% -------100% ===== Final 40% 10% 50% -------100% =====

FINAL GRADE = 30% Prelim Grade + 30% Midterm Grade + 40% Final Grade

Prepared by: MS. HACEL SAUL-ADRIANO Subject Coordinator

Date:

Reviewed by:

Date:

Approved by : DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 1/5

MR. JHAN BENEDICT G. GAMBA Program Head

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY
4.0 Course Requirement: Discrete Structures II

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

5.0 Course Content
Time Frame (No. of Sessions) Topics Specific Objectives Strategies Evaluation Tools

PRELIM PERIOD
5.0 1. Preliminaries 1.1 1.2 1.3 1.4 Strings, Alphabets, and Language Graphs & Trees Set notation Relations Enumerate some logics on how to make the state diagram and string manipulation Lecture, Discussions & Recitation Exercises seat work and board work. Quiz # 1 Exercises seat work and board work. Locate and analyze the difference between DFA and NFA
Reviewed by: Date:

1.0 1.0 5.0 1.0
Prepared by:

2. Finite Automata 2.1 Finite State System 2.2 Basic Definitions 2.3 Non Deterministic Automata
Date:

Lecture, Discussions & Recitation
Approved by :

Quiz # 2

MS. HACEL SAUL-ADRIANO Subject Coordinator

MR. JHAN BENEDICT G. GAMBA Program Head

DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 2/5

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0 Preliminary Examination

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

Time Frame (No. of Sessions 5.0

Topics

Specific Objectives

Strategies

Evaluation Tools

MIDTERM PERIOD
2.4 The Equivalence of DFA’s and NFA’s 2.5 Finite Automata with e-moves Combine the equivalence of DFA and NFA Course Requirements 3. Regular Expressions 3.1 Equivalence of Finite Automata and Regular Expressions 3.2 Two-way Finite Automata 3.3 Finite Automata with output 3.4 Applications of Finite Automata Describe regular expressions Lecture, Discussions & Recitation Lecture, Discussions & Recitation

Exercises, seat Work and board work. Quiz # 3 Exercises seat work and board work.

1.0 5.0

1.0

Quiz # 4
Reviewed by: Date: Approved by : DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 3/5

Prepared by: MS. HACEL SAUL-ADRIANO Subject Coordinator

Date:

MR. JHAN BENEDICT G. GAMBA Program Head

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0 Midterm Examination

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

Time Frame (No. of Sessions

Topics

Specific Objectives

Strategies

Evaluation Tools

Prepared by: MS. HACEL SAUL-ADRIANO Subject Coordinator

Date:

Reviewed by:

Date:

Approved by : DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 4/5

MR. JHAN BENEDICT G. GAMBA Program Head

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY
FINAL PERIOD
4.0 4. Context free Grammar 4.1 Definition of Context free Grammar 4.2 Context free Grammar 5. Push Down Automata 5.1 Description 5.2 Definitions 5.3 Push down automata and context free languages 6. Turing Machine 6.1 Turing Machine Model 6.2 Techniques for Turing Machine Model Derive a context-free grammar

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

Lecture, Discussions & Recitation

Exercises, seat Work and board work.

3.0 1.0 3.0 1.0

Derive a push down automata

Lecture, Discussions & Recitation Quiz # 5

Locate and replace the right string to the Turing machine

Lecture, Discussions & Recitation

Exercises seat work and board work. Quiz # 6 Final Examination

Prepared by: MS. HACEL SAUL-ADRIANO Subject Coordinator

Date:

Reviewed by:

Date:

Approved by : DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 5/5

MR. JHAN BENEDICT G. GAMBA Program Head

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Course Code: CSCI18

Document Code: RF – CSP - 021 Revision No: 01 Effectivity Date: 1ST Trimester SY 2010-2011 Laboratory Unit: 0

COURSE SYLLABUS
COLLEGE OF COMPUTER STUDIES
Course Title: AUTOMATA AND FORMAL LANGUAGE THEORY

Prerequisite: CSCI09 Issue No: 01 Lecture Unit: 3

6.0 Text book 6.1 Introduction to Automata theory, Languages, and Computation by John E. Hopcroft & Jeffrey D. Ullman 7.1 7.2 7.3 7.4 7.5 8.1 8.2 7.0 References Introduction to Formal Language Theory (Copyright 2000) by Robert Moll, Micheal Kfoury Introduction to Formal Languages and Automata (Copyright 2000) by Peter Linz Algebraic Theory of Automata and Languages (Copyright 2002) by Masami Ito Automata and Languages: Theory and Applications (Copyright 2002) by Alexander Meduna Problem Solving in Automta, Languages and Complexity (Copyright 2001) by Ding-Zhu Du 8.0 Required or Suggested Readings Models of Computation and Formal Languages by Ralph Gregory Taylor Finite Automata, Formal Logic and Circuit Complexity by Howard Straubing

Prepared by: MS. HACEL SAUL-ADRIANO Subject Coordinator

Date:

Reviewed by:

Date:

Approved by : DR. RICHARD MORRIS A. SANTOS Dean, College of Computer Studies 6/5

MR. JHAN BENEDICT G. GAMBA Program Head

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the College Dean. The user should secure the latest revision of this document from the Dean’s office.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.