Instructor Name:      Aliza Ahmed Khan             Designation:                Senior Lecturer              Email:                          aliza.cse@diu.edu.bd              Contact:                 01715918474              Office Address:           Room 805, AB04, Level -4,DSC.

Course Rational:

The Theory of Computing course aims to provide students with a deep understanding of fundamental principles in computer science. This course covers key topics such as automata theory, formal languages, computability, and complexity theory. Students will explore the theoretical underpinnings of computation, gaining insights into the limits and capabilities of algorithms and machines. The course equips students with essential knowledge for analyzing the efficiency and feasibility of algorithms, and lays the foundation for advanced studies in theoretical computer science.

Course Objectives:

1. To learn the basic concepts of Finite Automata.

2. To understand different types of finite automata and their design approaches.

3. To learn regular expressions and its conversion to Regular Language and finite automata.

4. To learn context free grammar and its construction techniques.

5. To learn Turing machine and its basics

Course Learning Outcome:

1.  Design deterministic finite automata with explaining the terms of Finite Automata

2. Design non-deterministic Finite Automata along with the comparison of DFA and NFA.

3. Apply conversion techniques of regular expression and Construct context free grammar by explaining derivation and parse tree and ambiguity.

4. Illustrate Turing machines and its functionalities

Course Content:

• Introduction

• Finite Automata

• Deterministic Finite Automata (DFA)

• Non-deterministic Finite Automata (NFA)

• Conversion of NFA to DFA

• Regular Expression

• Pushdown Automata

• Context free languages

• Context free grammars

• Turing Machines Basics