Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

automata and formal languages, Assignments of Formal Semantics

formal language and automata theory

Typology: Assignments

2020/2021

Uploaded on 03/27/2021

shtechane
shtechane ๐Ÿ‡ช๐Ÿ‡น

5

(1)

5 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Harambe University cOLLEGE
Department of Computer Science
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
pf3

Partial preview of the text

Download automata and formal languages and more Assignments Formal Semantics in PDF only on Docsity!

Harambe University cOLLEGE

Department of Computer Science

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

๏ƒ˜ Operation on Languages

๏ƒ˜ Definition of a Grammar

๏ƒ˜ Chomsky Classification of Language

4 Regular Sets and Regular Grammars

๏ƒ˜ Operations on Languages

๏ƒ˜ Regular Expressions

๏ƒ˜ Equivalence of Regular Expressions and NFA

๏ƒ˜ Inductive Hypothesis

๏ƒ˜ Ardenโ€™s Theorem

๏ƒ˜ Lemma Theorem

(^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

  • An Introduction to Formal Languages and Automata, Third Edition, Peter Linz, 2001 or new edition