Lyceum of the Philippines University

College of Engineering, Computer Studies, and Architecture

Effective 1st Semester, AY 2020-2021

SYLLABUS

Subject Code : CSCN05C

Subject Title : Automata & Language Theory
No. of Units : Three (3) Units
Lecture Hours/Week : Three (3) hours
Laboratory Hours/Week : None
Pre-requisite : CSCN03C – Design and Analysis of Algorithm

Course Description:

This course introduces the fundamental concepts of formal languages and automata. It emphasizes the general principles of
formal languages, grammars and automata theory. Topics include finite automata, regular expressions, regular languages and their
properties, context-free grammars, languages and their properties, and pushdown automata.

Program Objectives:

1. To deliver quality instructions through the use of the state-of-the-art equipment to further enhance the teaching methodology;
2. To develop and internationally accepted IT curriculum that conforms with the minimum requirements of the Commission of
Higher Education as the foundation of learning;
3. To expose the students with the latest gadgets, equipment and software packages available in the industry today for them to
develop a sense of readiness;
4. To provide students with the in-depth knowledge in Automata and Language Theories

Learning Goals:

Upon completion of the course, the student shall be expected to:

Competencies Learning Goals Mission De-

ployment
1. Communication Explain and use the concepts of automata and language theory. 1, 2, 3
2. Information Retrieval & Apply automata and language theory techniques to solve problems. 1,2,3,4
Evaluation
3. Proactive and Spiritual Val- Exhibit the spirit of Faith by understanding automata and language theory in 6
ues (REVISED) light of the Gospel, law and international standard.
4. Teamwork and Leadership Advance acquisition of skills in information technology of the use of automata 5
and language theory concepts which address the specific needs of community.
5. Creative and Analytical Solve problems in relation to what happens in the industry and perform various 1,2,3,5
Thinking (REVISED) operations with automata and language theory.
6. Computer Literacy Relate and apply automata and language theory concepts to practical applica- 1,2,3
tions of computer science and information technology.
7. Entrepreneurial Become sensitive to the rule of automata and language theory knowledge for 3
gaining competitive advantage in an expanding global marketplace.

Learning Objectives:

1. Affective
1.1 Effectively use automata & language theory concepts to solve problems.
1.2 Manifest the spirit of Communion by inculcating the usefulness of automata & language theory concepts in the
community.
1.3 Enhance competencies in structuring, organizing and forming logic.
1.4 Acquire advance training in translating automata & language theory knowledge into marketable products.
1.5 Share the importance and characteristics of the latest automata & language theory used in the industry.
CSCN05C - Automata & Language Theory Page 1 of 5
 2. Cognitive
2.1 Define clearly the automata & language theory, its kinds, structures and basic concepts.
2.2 Classify various types of automata & language theory.
2.3 Learn and explain the whole concepts of automata & language theory.

3. Psychomotor
3.1 Solve problems involving recurrence relations and generating functions.
3.2 Perform operations on discrete structures such as sets, functions, relations, and sequences.
3.3 Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases, and mathematical
induction.
3.4 Introduce concepts in automata theory and theory of computation
3.5 Identify different formal language classes and their relationships
3.6 Design grammars and recognizers for different formal languages

Course Outline

LEARNING OBJECTIVES SUBJECT MATTER OUTCOMES-BASED METHODOLOGY WEEK/HRS.

Discuss all the necessary
requirements such as attendance,
written quizzes, long test, major
exams final projects and
compliance of standard policies
Course Orientation
Consequence Game. Student chosen randomly 1st Week
will introduce themselves mentioning only items (1.5 hour)
given by the teacher. Every after student introduc-
tion one student will answer question related to the
previous introduction. If the latter will not able to
answer he will face consequence by showcasing
his talent.

Explain with examples the basic Sets theories, Relations and Students analyze the concept explained by teacher 2nd week –
terminology of functions, relations Operations through Powerpoint Presentation. 3rd Week
and sets
(6 hrs)
Perform the operations associated
with sets, functions, and relations

Describe the formal definition of Deterministic Finite Students analyze the concept explained by teacher 4th – 5th week
DFA using the 5-tuples Automaton (DFA) through Powerpoint Presentation. (6hrs )

Create and analyze transition Students explain in their own understanding after
diagram and tables teacher discussion of the topic.

Seatwork #1 and Quiz #1: Given the test paper

Provide accepting/valid strings student will answer the questions individually re-
lated to the topic at hand.
Identify Language generated by
the DFA

Create and analyze transition
diagram and tables
Provide accepting/valid strings
Identify Language generated by
the NFA
Convert NFA to DFA
Nondeterministic Finite Students analyze the concept explained by teacher 6th – 7th week
Automaton (NFA) through Powerpoint Presentation.
(4.5hrs)
Students explain in their own understanding after
Conversion of NFA to DFA teacher discussion of the topic.
Seatwork #2 and Quiz #2: Given the test paper
student will answer the questions individually re-
lated to the topic at hand.

7th week

CSCN05C - Automata & Language Theory Page 2 of 5

 LEARNING OBJECTIVES SUBJECT MATTER OUTCOMES-BASED METHODOLOGY WEEK/HRS.

Preliminary Exam (1.5 hours)

Sub-Total Hrs. 21 hrs.
Discuss the formal definition of NonDeterministic Finite Students analyze the concept of ε-NFA by 8th week
NonDeterministic Finite Automata Automata with ε-moves (ε- designing the transition diagram, rules and (3hrs)
with ε-moves NFA) transition table generated.

Explain the concept behind ε-NFA Conversion of ε-NFA to Students create the equivalent NFA for the given
NFA ε-NFA
Provide accepting/valid strings
Seatwork #3 and Quiz #3: Given the test paper
Identify Language generated by student will answer the questions individually re-
the ε-NFA lated to the topic at hand.

Analyze the representations of set Regular Expression Students analyze the concept of RE through simu- 9th week
of strings in a Regular Expression lation and board works. (3hrs)

Discuss the properties of a
Regular Expression
Design RE for a given language.
Apply the syntactical rules for
conversation in natural languages
Describe the formal definition of (CFG)
Grammar using the 4-tuples
Apply simplification of Context-
Free Grammar (CFG)
Seatwork #4 and Quiz #4: Given the test paper
student will answer the questions individually re-
lated to the topic at hand.
Grammar Students analyze the concept of CFG through sim- 10th week
ulation and board works. (3hrs)
Context Free Grammar
Students should simplify CFG
Seatwork #5 :

Explain the concept of Chomsky Chomsky Normal Form Students perform simulation using production 11th -12th week
Normal Form (CNF) (CNF) rules. (7.5hrs)

Convert Context-Free Grammar to Conversion of CFG Seatwork #6 and Quiz #5: Given the test paper
Chomsky Normal Form student will answer the questions individually re-
lated to the topic at hand.
12th week
Midterm Exam (1.5hrs)
Sub-Total Hrs. 15 hrs.
Prove the language is NOT Pumping Lemma for Students analyze the theorems in proving that the 13th week
Regular using Pumping Lemma Regular Language language is NOT Regular. (3hrs)

Seatwork #7
Implement the concept of Push Push-Down Automata Students should be able to implement PDA in de- 14th week
Down Automata in the same way (PDA) signing Finite Automata for Regular Expression (3hrs)
with Context-Free Grammar in
designing Finite Automata for RE Application of stocks with Seatwork #8 and Quiz #6
finite size
Convert a regular expression into
its equivalent NFA
Prove that the language is NOT Pumping Lemma for Students are expected to prove that the language is 15th week
context free using Pumping Context-Free Language NOT context free using pumping lemma (3hrs)
Lemma for CFL
Students should be able to apply proving using
Apply proving using contradiction contradiction.
technique

CSCN05C - Automata & Language Theory Page 3 of 5

 LEARNING OBJECTIVES SUBJECT MATTER OUTCOMES-BASED METHODOLOGY WEEK/HRS.

Seatwork #9 and Quiz #7

Explain the concept of Turing Turing Machine Students should be able to explain the concept of a 16th – 17th week
Machine and its application to Turing Machine. (6hrs)
computer science
Identify the relationship of Turing Students can identify the relationship of Turing
Machine with PDA, FSM and Machine with other simple machine in automata
undecidable machine. theory.

Draw and simulate a simple Students should be able draw and simulate a sim-
Turing Machine. ple Turing Machine.
Final Exam 18th week
(2 hrs.)
Sub-Total Hrs. 18 hrs.
Total Hours 54 hours

References:
a. 2014, Cecil Jose A. Delfinado, Automata Theory
b. 2016, Pandey, Adesh Kumar, An Introduction to Automata Theory & Formal language
c. 2014, Rigo, Michael, Formal Languages, Automata and Numeration system 1
d. 2013, Auradha, K., Formal Language & Automata Theory

Course Requirements:
1. Assignments
2. Short Quizzes/Long quizzes
3. Laboratory Activities
4. Seat Works/ Logic Problems
5. Projects/ Case Studies
6. Class Participation. It encompasses your daily recitation, participation expressed nonverbally by nodding your head when you
agree with the ideas of your classmate/teacher or by shaking your head (or other nonverbal expressions) when you express your
disagreement, the frequency of your asking sensible questions, the instances when you shared your insights/reflections etc.
7. Major Examination

Prelim Term Mid Term Final Term

Creative Academic Performance 60% Creative Academic Performance 60% Creative Academic Performance 60%
Prelim Term Exam 40% Mid Term Exam 40% Final Term Exam 40%
Total 100% Total 100% Total 100%

FINAL GRADE = Prelim-Term Grade x 33.33 + Midterm Grade x 33.33 + Final Grade x 33.34

Classroom Policies:

1. Cheating plagiarizing - refer to student handbook

2. Medical absences - submit medical certificate to Clinic for notation
3. Completion procedures - refer to student handbook
4. Uniform guidelines - follow guidelines
5. Classroom decorum.

Prepared and Updated Validated by:/Date Endorsed by:/Date Approved by:/Date

by/Date: August 6, 2020

Mr. Elmer C. Matel

Faculty Member/s

CSCN05C - Automata & Language Theory Page 4 of 5

 Mr. Gerald C. Bataoil
Mr. Joven B. Cajigas Industry Advisory
Chairperson/Coordinator Board Dean/ College Secretary VPAA/ Executive Dean

CSCN05C - Automata & Language Theory Page 5 of 5