Professional Documents
Culture Documents
PROGRAM : BSCS
COURSE : AUTOMATA & THEORY
COURSE CODE : CS 14
PREREQUISITE : None
I. INSTITUTIONAL VISION:
To become the leading institution for professional development and the first and foremost
provider of quality, affordable and sustainable development education.
2. Truthfulness
Truthfulness is characterized by embracing honesty in thoughts, words and deeds of all concerned
individuals who are part of the school community.
3. Compassion
Selflessness and genuine concern for others are instilled in Clareans through constant exposure to
various academic, extracurricular and co-curricular activities that will bring out their
compassionate attribute.
4. Love
Love for oneself, for others and for noble causes are pivotal in cultivating a well-rounded
individual who embodies unwavering desire and sustained commitment in undertaking
5. Amiable
Displaying a friendly disposition and pleasant attitude towards other people inspires positive
rapport and desirable outcomes.
6. Righteousness
All concerned members are expected to uphold the ideals and moral
principles of the institution as a reflection of their integrity and dignity.
7. Ever Loyal
Remaining steadfast to the ideals and good name of the institution is a desirable impression
ingrained in the minds and hearts of all the members of the school community.
2. Effective Communication
Graduates are proficient and skillful in the four areas of communication: reading, writing, listening
and speaking. They can use their skills in solving problems and articulating their thoughts when
engaging with people in various situations.
8. Community Engagement
Graduates assume an active role in organizing projects, programs and activities to help and
advance the interest and welfare of the people in their respective communities.
The course introduces some fundamental concepts in automata theory and formal languages
including grammar, finite automaton, regular expression, formal language, pushdown automaton,
and Turing machine.
DFA Minimization
Moore & Mealy Machines
MONTHLY EXAMINATION
WEEK 5-8 Classification of Grammars
Introduction to Grammars
Language Generated by a Grammar
Chomsky Grammar Classification
PERIODICAL EXAM
WEEK 9-12 Regular Grammar
Regular Expressions
Regular Sets
Arden's Theorem
Constructing FA from RE
Pumping Lemma for Regular Grammar
DFA Complement
MONTHLY EXAMINATION
WEEK 13-16 Pushdown Automata
PDA & Context Free Grammar
PDA & Parsing
Pushdown Automata Acceptance
MONTHLY EXAMINATION
WEEK 17-18 Turing Machine
Turing Machine Introduction
Accepted & Decided Language
FINAL EXAMINATION
VIII. REFERENCES
1. Hopcroft, J. E., Motwani, R., and Ullman, J. D. (2006). Introduction to Automata Theory,
Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc.,
Boston, MA, USA
2. Linz, P. (2017). An Introduction to Formal Languages and Automata, Sixth Edition. Jones and
Bartlett Publishers, Inc., USA, 6th edition.
3.
XI. GRADING SYSTEM
X. CLASSROOM POLICIES
1. Attend class regularly.
2. Submit all written and present oral output.
3. Attend assigned group discussion and reporting.
4. Accomplished final presentation.
Prepared by:
Recommending Approval:
Approved by:
NOTE ***This course plan can be revised according to your best judgment.
If revisions or improvements were made, kindly notify the dean or the department head concerned.
Your suggestions/recommendations are important for the refinement of our course plan.