‫لوړو زده کړو وزارت‬

‫خراسان پوهنتون‬
‫کمپيوټرساينس پوهنځي‬
‫کورس پاليسي‬

TOA (Theory of Automata) ‫مضمون‬

Arshad Momand ‫استاد‬

0704232331 ‫د استاد اړيکه‬

8th ‫سمستر‬

CS422 ‫د مضمون کود نمبر‬

04 ‫کريديتونو شمير‬

Discrete Mathematics, Calculus Prerequisite subjects

 An introduction to the mathematical theory of languages and grammars ‫د زده کړې هدفونه‬
for deterministic and non-deterministic finite state machines.
 The method of instruction will be lecture, class discussion, project / ‫د زده کړې او تدريس طريقي‬
assignments and online activities.
‫ بجو پوری‬۷:۰۰ ‫ څخه تر‬۴:۰۰ ‫ پوری او د ماښام‬۱۱:۳۰ ‫ څخه تر‬۸:۳۰ ‫د سهر‬ ‫د دايريدو وختونه‬

 Internal assessments, includes assignments, seminars, case studies, ‫د کورس ارزيابي‬

quizzes, viva etc.
‫منابع اوماخذ‬
 Introduction to Computer Theory 2nd edition by Daniel I.A. Cohen
 Introduction to Computer Theory Wiley &. sons, Second Edition
 Introduction to Languages and Theory of Computation
J. C. Martin, Third Edition

‫د سمتر په اوږدو کې د کورسونو د دايرديدو د وختونو جدول‬

‫د ارزيابۍ طريقې‬ ‫درسی او زده کړه‬ ‫اهداف‬ ‫عنوان‬ ‫هفته‬

‫ايز فعاليتونه‬

 Quizzes,  Lectures are  Students will  Introduction to the course ‫اوله هفته‬
assessment, exams, provided through learn about title, Formal and In-formal
class group LCD screens, Group software, software languages, Alphabets,
 discussion, discussion, Question engineering, Need Strings, Null string, Words,
presentation, hot and answer method of software Valid and In-valid alphabets,
seat. are used. engineering length of a string, Reverse of
a string..
 Quizzes,  Lectures are  Students will ‫دوهم هفته‬
assessment, exams, provided through learn about  Defining languages,
class group LCD screens, Group software, software Descriptive definition of
discussion, discussion, Question engineering , languages, Examples, Kleene
presentation, hot and answer method Need of software Star Closure, Plus operation,
seat. are used. engineering
 Quizzes,  Lectures are  Students will  Recursive definition of ‫درېيمه‬
assessment, exams, provided through learn about languages, Examples, ‫هفته‬
class group LCD screens, Group software, software Regular Expression,
discussion, discussion, Question engineering, Need Recursive definition of RE,
presentation, hot and answer method of software defining languages by RE,
seat. are used. engineering Examples
 Quizzes,  Lectures are  Students will  Regular expression of ‫څلورم هفته‬
assessment, exams, provided through learn about EVEN-EVEN language,
class group LCD screens, Group software, software Difference between a* + b*
discussion, discussion, Question engineering, Need and (a+b)*, Equivalent
presentation, hot and answer method of software regular expressions; sum,
seat. are used. engineering product and closure of
regular expressions; regular
languages, introduction to
finite automaton, definition
of Finite Automata, transition
table, transition diagram
 Quizzes,  Lectures are  Students will  Different notations of ‫پنځه هفته‬
assessment, exams, provided through learn about transition diagrams,
class group LCD screens, Group software, software Examples of FAs
discussion, discussion, Question engineering, Need  FA corresponding to finite
presentation, hot and answer method of software languages, Transition graphs
seat. are used. engineering (TG), Examples of TGs,
Definition of Generalized
Transition Graph (GTG)
 Quizzes,  Lectures are  Students will  Examples of GTG, ‫شپږمه هفته‬
assessment, exams, provided through learn about Nondeterminism, Kleene’s
class group LCD screens, Group software, software theorem (part I, part II, part
discussion, discussion, Question engineering, Need III), proof of Kleene’s
presentation, hot and answer method of software theorem part I, Proof of
seat. are used. engineering Kleene’s theorem part II
(method with different steps),
particular examples of TGs
to determine corresponding
REs.

 Quizzes,  Lectures are  Students will  Examples of writing REs to ‫اوومه هفته‬
assessment, exams, provided through learn about the corresponding TGs,
class group LCD screens, Group software, software Kleene’s theorem part III
discussion, discussion, Question engineering, Need (method 1: union of FAs),
presentation, hot and answer method of software Examples of FAs
seat. are used. engineering corresponding to simple REs,
Example of Kleene’s
theorem part III (method 1)
Kleene’s theorem part
III (method 2: Concatenation
of FAs), Example of
Kleene’s theorem part
 III (method 2:
Concatenation of FAs)

 Quizzes,  Lectures are  Students will  Kleene’s theorem part III ‫اتمه هفته‬
assessment, exams, provided through learn about (method 3: closure of an FA),
class group LCD screens, Group software, software Examples of Kleene’s
discussion, discussion, Question engineering, Need theorem part III(method
presentation, hot and answer method of software 3:Closure of an FA)
seat. are used. engineering Examples of Kleene’s
theorem part III (method 3),
NFA, Examples, Converting
FA to NFA, Examples,
applying an NFA on an
example of maze, NFA with
null string, Examples,
converting NFA to FA
(method 1,2,3), Examples
 Quizzes,  Lectures are  Students will  Converting NFA to FA ‫نهم هفته‬
assessment, exams, provided through learn about (method 3), Example, NFA
class group LCD screens, Group software, software and Kleene’s theorem
discussion, discussion, Question engineering, Need method 1, Examples, NFA
presentation, hot and answer method of software and Kleene’s theorem
seat. are used. engineering method 2 , NFA
corresponding to union of
FAs, Example, NFA
corresponding to union of
FAs, Example, NFA
corresponding to
concatenation of FAs,
Examples, NFA
corresponding to closure of
an FA, Example
 Layout Tab (Page Setup)
 Quizzes,  Lectures are  Students will  NFA corresponding to ‫لسمه هفته‬
assessment, exams, provided through learn about Closure of FA, Examples,
class group LCD screens, Group software, software Memory required to
discussion, discussion, Question engineering, Need recognize a language,
presentation, hot and answer method of software Example, Distinguishing one
seat. are used. engineering string from another,
Example, Theorem, Proof
 Quizzes,  Lectures are  Students will  Finite Automaton with ‫يوولسمه‬
assessment, exams, provided through learn about output, Moore machine, ‫هفته‬
class group LCD screens, Group software, software Example of Moore machine,
discussion, discussion, Question engineering, Need Mealy machine, Examples,
presentation, hot and answer method of software complementing machine,
seat. are used. engineering Incrementing machine.
 Quizzes,  Lectures are  Students will  Applications of ‫دولسمه‬
assessment, exams, provided through learn about complementing and ‫هفته‬
class group LCD screens, Group software, software incrementing machines,
discussion, discussion, Question engineering, Need Equivalent machines, Moore
presentation, hot and answer method of software equivalent to Mealy, proof,
seat. are used. engineering example, Mealy equivalent to
Moore, proof, example,
Mealy machines in terms of
sequential circuit
 Quizzes,  Lectures are  Students will  Context Free Grammar, ‫ديارلسمه‬
assessment, exams, provided through learn about Terminals, non-terminals, ‫هفته‬
class group LCD screens, Group software, software productions, CFG, context
discussion, discussion, Question engineering, Need Free language, Examples.
presentation, hot and answer method of software Examples of CFLs, Parsing
seat. are used. engineering tree, Example of trees, Polish
Notation, Examples,
Ambiguous CFG, Example
 Quizzes,  Lectures are  Students will  Example of Ambiguous ‫څوارلسمه‬
assessment, exams, provided through learn about Grammar, Example of ‫هفته‬
class group LCD screens, Group software, software Unambiguous Grammar
discussion, discussion, Question engineering, Need (PALINDROME), Total
presentation, hot and answer method of software Language tree, Examples,
seat. are used. engineering (Finite and infinite trees),
Regular Grammar, FA to
CFG, Semi word and Word,
Theorem, Defining Regular
Grammar, Method to build
TG for Regular Grammar,
Examples of building TG’s
corresponding to the Regular
Grammar, Null productions
with examples, Null able
productions with examples,
Unit production with
example, Definition
of Chomsky Normal Form
(CNF)
 Quizzes,  Lectures are  Students will  Chomsky Normal Form, ‫پنځه لسمه‬
assessment, exams, provided through learn about Theorem regarding CNF, ‫هفته‬
class group LCD screens, Group software, software Examples of converting CFG
discussion, discussion, Question engineering, Need to be in CNF, Example of an
presentation, hot and answer method of software FA corresponding to Regular
seat. are used. engineering CFG, Left most and Right
most derivations, New
format of FAs.
 Quizzes,  Lectures are  Students will  New format for FAs, input ‫شپاړلسمه‬
assessment, exams, provided through learn about TAPE, START, ACCEPT, ‫هفته‬
class group LCD screens, Group software, software REJECT, READ states
discussion, discussion, Question engineering, Need Examples of New Format of
presentation, hot and answer method of software FA, PUSH Down STACK,
seat. are used. engineering PUSH and POP, Example of
PDA, Example of PDA with
table for running a string,
Equivalent PDA, PDA for
EVEN EVEN Language.
Non-Deterministic PDA.
