Introduction to Theory of Automata By: Wasim Ahmad Khan.

Slides:



Advertisements
Similar presentations
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Advertisements

Chapter Chapter Summary Languages and Grammars Finite-State Machines with Output Finite-State Machines with No Output Language Recognition Turing.
Finite Automata Section 1.1 CSC 4170 Theory of Computation.
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
Intro to DFAs Readings: Sipser 1.1 (pages 31-44) With basic background from Sipser 0.
Chapter 3 Describing Syntax and Semantics Sections 1-3.
Chapter 16 Programming and Languages: Telling the Computer What to Do.
Chapter 3 Describing Syntax and Semantics Sections 1-3.
Theory Of Automata By Dr. MM Alam
1 Introduction to Automata Theory Reading: Chapter 1.
Computational Linguistics Yoad Winter *General overview *Examples: Transducers; Stanford Parser; Google Translate; Word-Sense Disambiguation * Finite State.
Welcome to Honors Intro to CS Theory Introduction to CS Theory (Honors & Traditional): - formalization of computation - various models of computation (increasing.
Theory of Automata.
L ECTURE 1 T HEORY OF A UTOMATA. P RAGMATICS  Pre-Requisites  No Pre-Requisite  Text book  Introduction to Computer Theory by Daniel I.A. Cohen 
Introduction to Theory of Automata
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
Introduction to CS Theory Lecture 3 – Regular Languages Piotr Faliszewski
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Theory of Computation - Lecture 3 Regular Languages What is a computer? Complicated, we need idealized computer for managing mathematical theories... Hence:
Welcome to Honors Intro to CS Theory Introduction to CS Theory (Honors & Traditional): - formalization of computation - various models of computation (increasing.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
Copyright © Curt Hill Languages and Grammars This is not English Class. But there is a resemblance.
Introduction to Theory of Automata By: Wasim Ahmad Khan.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Finite Automata – Definition and Examples Lecture 6 Section 1.1 Mon, Sep 3, 2007.
Chapter 1: Introduction 1 Compiler Designs and Constructions Chapter 1: Introduction Objectives: Course Objectives Introduction Dr. Mohsen Chitsaz.
Introduction Episode 0 What is TOC (Theory of Computation) about? Giorgi Japaridze Theory of Computability Subject: The fundamental mathematical properties.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
نظام المحاضرات الالكترونينظام المحاضرات الالكتروني Theory of Automata We will arrive at what we may believe to be the most powerful machine possible. When.
Language Language - a system for combining symbols (such as words) so that an unlimited number of meaningful statements can be made for the purpose of.
Welcome to Form 4 Mathematics Topic for the day SETS.
Lecture # Book Introduction to Theory of Computation by Anil Maheshwari Michiel Smid, 2014 “Introduction to computer theory” by Daniel I.A. Cohen.
Formal Language. A formal language is defined by two components: -Alphabet -Rules of syntax.
Theory of computation Introduction theory of computation: It comprises the fundamental mathematical properties of computer hardware, software,
1 Course Overview Why this course “formal languages and automata theory?” What do computers really do? What are the practical benefits/application of formal.
Introduction Why do we study Theory of Computation ?
C Sc 132 Computing Theory Professor Meiliu Lu Computer Science Department.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
By Dr.Hamed Alrjoub. 1. Introduction to Computer Theory, by Daniel I. Cohen, John Wiley and Sons, Inc., 1991, Second Edition 2. Introduction to Languages.
Lecture 01: Theory of Automata:2013 Asif Nawaz Theory of Automata.
Formal Languages and Automata FORMAL LANGUAGES FINITE STATE AUTOMATA.
Lecture #2 Advanced Theory of Computation. Languages & Grammar Before discussing languages & grammar let us deal with some related issues. Alphabet: is.
Introduction to Automata Theory
Computational and Evolutionary Aspects of Language Written by: Martin Nowak, Natalia Komarova, and Partha Niyogi Presentation by: Amerika Adams, Isaac.
Topic 3: Automata Theory 1. OutlineOutline Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.
Theory of Computation Automata Theory Dr. Ayman Srour.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesAlgebraic.
Introduction to Automata Theory Theory of Computation Lecture 3 Tasneem Ghnaimat.
Finite Automata.
Formal Language & Automata Theory
CSCI 2670 Introduction to Theory of Computing
System Software Unit-1 (Language Processors) A TOY Compiler
Lecture 1 Theory of Automata
Theory of Automata CS3434 Lecture 01.
CIS Automata and Formal Languages – Pei Wang
Non Deterministic Automata
Course 1 Introduction to Formal Languages and Automata Theory (part 1)
Theory of Computation Theory of computation is mainly concerned with the study of how problems can be solved using algorithms.  Therefore, we can infer.
FORMAL LANGUAGES AND AUTOMATA THEORY
Formal Language Theory
Algorithm and Ambiguity
Method of Language Definition
Introduction to Automata Theory
Formal Language.
THEORY OF COMPUTATION Lecture One: Automata Theory Automata Theory.
Principles of Computing – UFCFA3-30-1
Introduction Reading: Sections 1.5 – 1.7.
CSC 4170 Theory of Computation Finite Automata Section 1.1.
Sub: Theoretical Foundations of Computer Sciences
Recursive Definitions
Presentation transcript:

Introduction to Theory of Automata By: Wasim Ahmad Khan

What do you think about it ???  Automata?  Language?  Relation between Language and Machine?

What does “Theory of Automata” mean? The word “Theory” means that this subject is a more mathematical subject and less practical. Foundation for practical subject. Focuses on theoretical aspects of Computer Science.

Automata It is plural of Greek word Automaton, which means Machine in English. Hence, Automata means Machines.

Language Language is nothing except the collection of Rules.

Relation between Machine & Language As all of you know that to instruct any machine you need to know its language. Similarly, if you know a language that language is of no use unless you have a machine which can understand that language. So : Language and machine both are inter-related. One is useless in the absence of other.

Parts of the Language Alphabet/Symbol A finite non-empty set of specific symbols (letters), is called alphabet. It is denoted by Greek letter ∑ (Sigma). Word Specific letters in specific quantity and in Specific order. Sentence Specific words in specific quantity and in Specific order.

How to study language? There are two parts of study of a language 1. Structure/Syntax Its study includes how the correct words/sentences are formed. ( No syntax errors ) 2. Meaning/Semantics its study includes how to decide that a structurally correct formed word/sentence has a correct meaning associated or not. ( No Semantical errors )

Types of Language There are many types of languages but we have experience of using two types of languages:  Formal Languages ( Java/C++/Perl/C/ …)  Natural Languages (English/Hindi/Arabic/ …)

Formal Languages Formal means to study about form / structure /shape ; Meaning is out of Scope of our study of formal languages. For example: She is a boy. This sentence is structure wise correct but meaning wise incorrect. In formal languages it is correct but incorrect in Natural language English.