Introduction to Theory of Automata By: Wasim Ahmad Khan.

Slides:



Advertisements
Similar presentations
Chapter 2 Revision of Mathematical Notations and Techniques
Advertisements

Formal Languages Languages: English, Spanish,... PASCAL, C,... Problem: How do we define a language? i.e. what sentences belong to a language? e.g.Large.
Theory Of Automata By Dr. MM Alam
L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.
YES-NO machines Finite State Automata as language recognizers.
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory VII.
Regular Grammars Formal definition of a regular expression.
Regular Languages Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 3 Comments, additions and modifications.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Regular Languages Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 3 Comments, additions and modifications.
CS 3240 – Chuck Allison.  A model of computation  A very simple, manual computer (we draw pictures!)  Our machines: automata  1) Finite automata (“finite-state.
Topics Automata Theory Grammars and Languages Complexities
Theory Of Automata By Dr. MM Alam
Lexical Analysis CSE 340 – Principles of Programming Languages Fall 2015 Adam Doupé Arizona State University
CS490 Presentation: Automata & Language Theory Thong Lam Ran Shi.
Lecture # 1 (Automata Theory)
Theory of Automata.
1 Welcome to ! Theory Of Automata. 2 Text and Reference Material 1.Introduction to Computer Theory, by Daniel I. Cohen, John Wiley and Sons, Inc., 1991,
Module 2 How to design Computer Language Huma Ayub Software Construction Lecture 7 1.
CSC312 Automata Theory Lecture # 2 Languages.
CSC312 Automata Theory Lecture # 2 Languages.
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 
Formal Methods in SE Theory of Automata Qasiar Javaid Assistant Professor Lecture # 06.
Lecture Two: Formal Languages Formal Languages, Lecture 2, slide 1 Amjad Ali.
Introduction to Theory of Automata
Introduction to Theory of Automata By: Wasim Ahmad Khan.
1 Chapter 1 Introduction to the Theory of Computation.
Module 2 How to design Computer Language Huma Ayub Software Construction Lecture 8.
Lecture-2 Recap Lecture-1
1 Languages. 2 A language is a set of strings String: A sequence of letters Examples: “cat”, “dog”, “house”, … Defined over an alphabet:
L ECTURE 3 Chapter 4 Regular Expressions. I MPORTANT T ERMS Regular Expressions Regular Languages Finite Representations.
Chapter 5: Sequences, Mathematical Induction, and Recursion 5.9 General Recursive Definitions and Structural Induction 1 Erickson.
Regular Expressions and Languages A regular expression is a notation to represent languages, i.e. a set of strings, where the set is either finite or contains.
Mathematical Notions and Terminology Lecture 2 Section 0.2 Fri, Aug 24, 2007.
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
Recursive Definations Regular Expressions Ch # 4 by Cohen
نظام المحاضرات الالكترونينظام المحاضرات الالكتروني Theory of Automata We will arrive at what we may believe to be the most powerful machine possible. When.
Lecture # Book Introduction to Theory of Computation by Anil Maheshwari Michiel Smid, 2014 “Introduction to computer theory” by Daniel I.A. Cohen.
Lecture # 4.
Mathematical Foundations of Computer Science Chapter 3: Regular Languages and Regular Grammars.
1 Strings and Languages Lecture 2-3 Ref. Handout p12-17.
Lecture 02: Theory of Automata:2014 Asif Nawaz Theory of Automata.
Lecture 03: Theory of Automata:2014 Asif Nawaz Theory of Automata.
L ANGUAGE C ONCEPTS : F ORMAL M ODEL FOR L ANGUAGES Theory of Computer Akram Salah.
L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.
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.
Recap Lecture 3 RE, Recursive definition of RE, defining languages by RE, { x}*, { x}+, {a+b}*, Language of strings having exactly one aa, Language of.
Lecture 17: Theory of Automata:2014 Context Free Grammars.
Recap lecture 5 Different notations of transition diagrams, languages of strings of even length, Odd length, starting with b, ending in a (with different.
Theory of Computation Lecture #
Lecture # 2.
BCT 2083 DISCRETE STRUCTURE AND APPLICATIONS
Regular Languages, Regular Operations, Closure
Lexical Analysis CSE 340 – Principles of Programming Languages
Lecture 1 Theory of Automata
Theory of Languages and Automata
Mathematical Notions and Terminology
[Week#03,04] (b) - Finite Automata
Recap lecture 29 Example of prefixes of a language, Theorem: pref(Q in R) is regular, proof, example, Decidablity, deciding whether two languages are equivalent.
NFAs and Transition Graphs
Specification of tokens using regular expressions
Introduction Reading: Sections 1.5 – 1.7.
Chapter 1 Introduction to the Theory of Computation
CSC312 Automata Theory Lecture # 2 Languages.
Welcome to ! Theory Of Automata Irum Feroz
Recap Lecture 3 RE, Recursive definition of RE, defining languages by RE, { x}*, { x}+, {a+b}*, Language of strings having exactly one aa, Language of.
LECTURE # 07.
Recursive Definitions
Presentation transcript:

Introduction to Theory of Automata By: Wasim Ahmad Khan

Alphabet/Symbols/Character Set A finite non-empty set of specific symbols (letters), is called alphabet. It is denoted by Greek letter ∑ (Sigma). An alphabet is a finite set of symbols, usually letters, digits, and punctuations.

Types of alphabet 1. Valid Alphabets 2. Invalid Alphabets

Valid Alphabet If there is suffix but not prefix then it is a valid Alphabet, While defining an alphabet of letters consisting of more than one symbols, no letter should be started with the letter of the same alphabet. Valid Alphabet :

Invalid Alphabet If there is prefix present in an alphabet then it is an invalid Alphabet. Invalid Alphabet :

String Collection of characters/Combination of symbols from an alphabet or sigma( ∑ ) OR Finite Collection of Symbols For Example a+b & intabc both are strings.

Valid Strings Language is a collection of Valid strings. To declare strings symbols are basic things. Criteria All the character used to write a string must belong to the character set of said language. It must follow the “vary clear” rules defined by said Language.

Restrictions of Character Set 1. It should not be included Capital lambda. 2. It should not be empty. 3. It must be finite.

Examples ∑ represents character set ∑ = { a, b } I define a valid character set. Finite & non empty. ∑ = { a, b, …} Invalid ∑ = { 1, 2 } Valid, Finite, Non Empty

Some Special Symbols 1. Sigma ∑ 2. Capital Lambda Λ 3. Epsilon ε

Lexicographical Order According to this strings are arranged in a set length wise as indexing is used in dictionary. ∑ = { a, b } Strings = aa, ab, ba, bb ∑ = { b, a } Strings = bb, ba, ab, aa

Valid Lengths Smallest valid length is zero ( 0 ) Largest valid length could be any length you can made over sigma Length of a string Count of positions available to hold character. ∑ = { a, aa } aaa its valid length could be 2 and 3.

Null String String having length zero or a string having no position at all. Empty String A String having no character at all For example : { } It creates a confusion so we mostly use phi φ.

Example 1 ∑ = { a, b } L = All the strings over the above sigma. { Λ, a, b, aa, ab, ba, bb, aaa, aab, aba, abb, baa, bab, bba, bbb, …} Note: For continuation use only 3 dots.

Example 2 ∑ = { a, b } L = All the strings starting with ‘ a ’ over the above sigma. { Λ, a, aa, ab, aaa, aab, aba, abb, …}