Scribd
Upload
42 views

Theory of Automata and Formal Languages: Instructor: Dr. Muhammad Jehanzeb

This document provides an overview of the Theory of Automata and Formal Languages course being taught by Dr. Muhammad Jehanzeb. It outlines the rules and regulations, grading policy, recommended textbooks, course objectives, outline, and website for the course. The rules state that students must be on time, those absent on test dates will not get a second chance, and assignments must be submitted by the deadline. Grading will be based on a midterm, assignments, and a comprehensive final exam. The course website is listed as https://piazza.com, and instructions are provided for logging into the online platform.

Uploaded by

Kiran Zaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views

Theory of Automata and Formal Languages: Instructor: Dr. Muhammad Jehanzeb

This document provides an overview of the Theory of Automata and Formal Languages course being taught by Dr. Muhammad Jehanzeb. It outlines the rules and regulations, grading policy, recommended textbooks, course objectives, outline, and website for the course. The rules state that students must be on time, those absent on test dates will not get a second chance, and assignments must be submitted by the deadline. Grading will be based on a midterm, assignments, and a comprehensive final exam. The course website is listed as https://piazza.com, and instructions are provided for logging into the online platform.

Uploaded by

Kiran Zaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

Theory of Automata and

Formal Languages

Instructor: Dr. Muhammad Jehanzeb


jehanzeb.utm@gmail.com

Lecture 1

1
RULES AND REGULATIONS

 Students must reach the class‐room in time.

 Students, who are absent on the announcement date of


Quiz/Test, won’t have second chance.

 Assignment submission dead‐line must be observed


 Late submission will never be entertained

2
GRADING
 There will be One Mid Term exam and one final exam.
The final exam will be comprehensive. These will
contribute the following percentages to the final grade:

Mid-Term Exams. 30%


Assignments 20%
Final Exams. 50%

3
RECOMMENDED BOOKS
 Introduction to Computer Theory, by Daniel I. Cohen,
John Wiley and Sons, Inc., 1991, Second Edition

Introduction to Theory of Computation, 3rd Edition,


Michel Sipser, 2013 publication

Introduction to Languages and Theory of Computation,


4th Edition, John. C. Martin, 2011 Publication

4
COURSE OBJECTIVES
 To develop a strong fundamental concepts of theoretical
computer science.

 Knowledge of formal languages; such as, regular language,


non-regular languages: context free and non- context free
languages.

 To provide students with strong concepts of theorems


associated with these languages and their tools.
5
COURSE OUTLINE
o Basic concepts and definitions
o Equivalence relations
o Central concepts of Automata Theory.
o Regular Expressions
o Operations on Regular expressions
o Finite Automata and Regular Expressions.
o Conversion from FA and regular expressions.
o Deterministic Finite Automata (DFA).
o Non-Deterministic Finite Automata (NDFA). 6
COURSE OUTLINE (CONT.)

o Equivalence between DFA & NDFA


o Context-Free Grammar.
o Parse Trees; Ambiguity in Grammar and Languages.
o Pushdown Automata.
o Deterministic and Non- Deterministic(PDA).
oThe Turing Machine.

7
COURSE WEB SITE

https://piazza.com

8
PIAZZA PLATFORM

Students should
login by pressing
“Students Get
Started”

9
PIAZZA PLATFORM

Next Select “APCOMS


- Army Public College
of Management
Sciences” option form
search schools

10
PIAZZA PLATFORM

11
PIAZZA PLATFORM
Enter the Access
Code:
“TOAACS504”

Press the
button:
“Join Classes”

12
PIAZZA PLATFORM

Enter your Email


address. Then press
the submit email
button

13
INTRODUCTION TO THEORY OF AUTOMATA
What we learn as a computer science students?
1. Structural Programming
2. Object Oriented Programming
3. Data Structures and Algorithms
4. Numerical Analysis
5. Software Engineering
6. Operating Systems
7. and more …

In all these subject, we have to learn tools and techniques and apply them
accordingly.

Some methods are followed to compile the assignments/ problems and


submit them. 14
INTRODUCTION TO THEORY OF AUTOMATA

TOA is one of the most fundamental and abstract courses of computer


science.

Will help you understand how people have thought about computer
science as a science in past 50 years.

It is mainly about what kind of things can you really compute


mechanically, how fast and how much space does it take to do so.
15
INTRODUCTION TO THEORY OF AUTOMATA
In Theory of Automata good things are:

› Don’t do programming

› No compilers involved

16
INTRODUCTION TO THEORY OF AUTOMATA
TOA is a difficult subject because
The more focus will be on very simple question and base on your
thinking to solve the question.
For example, in this course we will answer the questions, i.e.
• What is a computer?
• What it do?
• Are there any limitation to computation?
• Can we solve any type of computation problem?

The answer can be in many ways, but theory of automata answer


17
then very precisely.
INTRODUCTION TO THEORY OF AUTOMATA
In Theory of Automata
The Mathematics used to answer the questions
Which will provide the very precise answers.

Therefore, we will focus on each question as it is a mathematical


question and will answer the question in the mathematical way
So, that answer should be very precise.

Hence, you have not to answer the questions in very long


theoretical way
The answer will be supported by the mathematical proves.
18
WHAT IS THEORY OF AUTOMATA?

Automata is the plural of automaton, and it means


“something that works automatically”

19
THE STORY OF COMPUTATION
It is a theoretical way to explain the problems

Earliest Models of Computation


• In 30 seconds draw the earliest model of computation that
comes up in your mind.

Who will be the earliest computers or the model of computers


that perform computation.
20
THE STORY OF COMPUTATION
Humans are the earliest computers.

It can also be said that the story of the computation is as old and
human beings exists. Therefore, we cannot say that when human
beings had started the computation. 21
THE STORY OF COMPUTATION
The earliest mathematical artifact is named as Lebombo bone
which dated back to 35,000 BC.

It was bone, used for additions. There are some mark which are
used for addition as shown.

After the above date, humans used clay tablets, which are found
in many civilizations.
22
THE STORY OF COMPUTATION
The earliest computer was the abacus, it is the device that was used
for very large computations in the old times.

23
THE STORY OF COMPUTATION
In 1600, an other computing device is discovered, which is called
slide rule

This ruler was developed after the discovery of logarithms. 24


THE STORY OF COMPUTATION
1. The earliest mathematical artifact is named as Lebombo bone,
which dated back to 35,000 BC.
2. Then clay tablets were used to store the count of live stock etc.
3. Abacus were used in 1000 BC and 500 BC in China and some
other countries.
4. Around 1620, John Napier introduced the concept of
logarithms. The slide rule was invented shortly afterwards.

25
INTRODUCTION TO LANGUAGES
There are two types of languages

Formal Languages (Syntactic languages)


Informal Languages (Semantic languages)

26
Q&A
27

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy