

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
formal language and automata theory
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Course Title : Formal Language Theory Course Code : CoSc 3111 Credit Hour : Credit hours = 3 Instructor : Shimelis T. Email: shimetechane@gmail.com Course Description: This course aims to develop the theoretical foundations of computer science through study of mathematical and abstract models of computers and the theory of formal languages. It also, introduces some fundamental concepts in automata theory and formal languages including grammar, finite automaton, regular expression, formal language, pushdown automaton, and Turing machine. Not only do they form basic models of computation, they are also the foundation of many branches of computer science, e.g. compilers, software engineering, concurrent systems, etc. Course Goal (Learning outcome): On completion of this course students should be able to: Introduce concepts in automata theory and theory of computation Study the central concepts of automata theory Acquire insights into the relationship among formal languages, formal grammars, and automata. Identify different formal language classes and their relationships. Design grammars and recognizers for different formal languages Prove or disprove theorems in automata theory using its properties Familiar with thinking analytically and naturally for problem solving situations in related areas of theory in computer science. Content of the course Chapter Title Detailed Content 1 Introduction Mathematical foundation and set ๏ Sets ๏ Representation of sets ๏ Finite set and infinite sets ๏ Sequence and tuples ๏ Relation and its types ๏ Function ๏ Boolean logic ๏ Graph and tree 2 The Theory of Automata ๏ Definition of automata ๏ Description of a Finite Automaton ๏ DFA ๏ NFA
๏ Equivalence of DFA and NFA ๏ Applications of FA 1 3 Formal Languages ๏ Symbol, Alphabets String and Language
4 Regular Sets and Regular Grammars
๏ Inductive Hypothesis
(^5) Context Free Language ๏ Definition of CFG ๏ Context Free Languages and Derivation Trees ๏ Right-Linear Grammar ๏ Right-Linear Gram mars and NFAs ๏ Left-Linear Grammar ๏ Definition of a Derivation Tree ๏ Parsing and ambiguity ๏ Ambiguous Grammars/Ambiguous Languages ๏ Simplification of CFG (^6) Pushdown Automata ๏ Formal Definition of PDF ๏ Characteristics of PDAs ๏ Summary of mathematical terms References