This document provides information about the course "Formal Language Theory" offered at Debre Markos University, Burie campus, Department of Computer Science. The 5 ECTS course aims to develop the theoretical foundations of computer science through the study of formal languages and automata theory. Over the course, students will learn about concepts like grammars, finite automata, pushdown automata, Turing machines and their applications in computer science areas such as compilers and software engineering. Students will be assessed through tests, assignments, a midterm exam, and a final exam.
This document provides information about the course "Formal Language Theory" offered at Debre Markos University, Burie campus, Department of Computer Science. The 5 ECTS course aims to develop the theoretical foundations of computer science through the study of formal languages and automata theory. Over the course, students will learn about concepts like grammars, finite automata, pushdown automata, Turing machines and their applications in computer science areas such as compilers and software engineering. Students will be assessed through tests, assignments, a midterm exam, and a final exam.
This document provides information about the course "Formal Language Theory" offered at Debre Markos University, Burie campus, Department of Computer Science. The 5 ECTS course aims to develop the theoretical foundations of computer science through the study of formal languages and automata theory. Over the course, students will learn about concepts like grammars, finite automata, pushdown automata, Turing machines and their applications in computer science areas such as compilers and software engineering. Students will be assessed through tests, assignments, a midterm exam, and a final exam.
This document provides information about the course "Formal Language Theory" offered at Debre Markos University, Burie campus, Department of Computer Science. The 5 ECTS course aims to develop the theoretical foundations of computer science through the study of formal languages and automata theory. Over the course, students will learn about concepts like grammars, finite automata, pushdown automata, Turing machines and their applications in computer science areas such as compilers and software engineering. Students will be assessed through tests, assignments, a midterm exam, and a final exam.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Debre Markos university
Burie campus Department of Computer Science Course Code: CoSc3111 Course title Formal Language Theory Degree program BSC in computer science Course load ECTS 5 Instructors’ Name Banchalem A 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 objectives 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 intuitively for problem solving situations in related areas of theory in computer science.
Introduction
Alphabets and Strings
Course outline Languages Grammars Automata Finite automata (FA) DFA -Formal definition Simplified notations (state transition diagram, transition table), Language of a DFA. NFA Equivalence of DFAs and NFAs Regular expression and regular language Regular expressions (RE),
applications of REs. Regular grammars and FA
FA for regular grammar,
Regular grammar
Pumping lemma and non-regular language grammars
Context free languages
Context free languages Parsing and ambiguity sentential forms Leftmost and right most derivation Derivation tree or Parse tree Simplification of context free grammar Methods for Transforming Grammars Normal for grammars and parsing
Pushdown automata Non deterministic Pushdown Automata Pushdown Automata and Context-Free Languages Deterministic push down automata and Deterministic context free language
Properties of context free language
Turing Machine The standard Turing machine Turing machine as machine accepters Turing machine as Transducers Universal Turing Machine Context sensitive grammars and languages Context sensitive languages and Linear bounded automata Relation between recursive and context sensitive languages
Assessment The course will be assessed using the different assessment methods like: Test:10% Assignments:20% Mid exam:30% Final exam:40% 1. An Introduction to Formal Languages and Automata, Third Edition, Reference Peter Linz, 2001 2. An Introduction to Formal Language Theory that Integrates Experimentation and Proof Allen Stoughton, 2004.
Reeeincarnation The Ultimate Guide To Rebirth, Karma and Old Souls and What Astrology, Wicca and Other Spiritual Practices Say... (Mari Silva (Silva, Mari) )
