CS2303-THEORY OF COMPUTATION

Slides:

Advertisements

Similar presentations

CS2303-THEORY OF COMPUTATION Closure Properties of Regular Languages

Advertisements

&& Department of nskinfo-i educationwww.nsksofttch.com CS2303-THEORY OF COMPUTATION uChapter: Closure.

Properties of Regular Sets

CS2303-THEORY OF COMPUTATION

Theory of Computing Lecture 23 MAS 714 Hartmut Klauck.

CSE 311 Foundations of Computing I

4b Lexical analysis Finite Automata

Reducing DFA’s Section 2.4. Reduction of DFA For any language, there are many DFA’s that accept the language Why would we want to find the smallest? Algorithm:

CMPS 3223 Theory of Computation

Lecture 24 MAS 714 Hartmut Klauck

Lecture # 11 Theory Of Automata By Dr. MM Alam 1.

Complexity and Computability Theory I Lecture #4 Rina Zviel-Girshin Leah Epstein Winter

Nondeterministic Finite Automata CS 130: Theory of Computation HMU textbook, Chapter 2 (Sec 2.3 & 2.5)

DFA Minimization Jeremy Mange CS 6800 Summer 2009.

Finite Automata CPSC 388 Ellen Walker Hiram College.

1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2005.

1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 3 School of Innovation, Design and Engineering Mälardalen University 2012.

Problem Solving. Model Drawing Steps: 1.Read the entire problem. 2.Decide who is involved in the problem. 3.Decide what is involved in the problem. 4.Draw.

CS5371 Theory of Computation

Transparency No Formal Language and Automata Theory Chapter 10 The Myhill-Nerode Theorem (lecture 15,16 and B)

Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.

CS 310 – Fall 2006 Pacific University CS310 Decidability Section 4.1/4.2 November 10, 2006.

Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.

1.Defs. a)Finite Automaton: A Finite Automaton ( FA ) has finite set of ‘states’ ( Q={q 0, q 1, q 2, ….. ) and its ‘control’ moves from state to state.

Theory of Computing Lecture 22 MAS 714 Hartmut Klauck.

Fall 2004COMP 3351 Another NFA Example. Fall 2004COMP 3352 Language accepted (redundant state)

1 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY For next time: Read 2.1 & 2.2.

Transparency No. 8-1 Formal Language and Automata Theory Chapter 8 DFA state minimization (lecture 13, 14)

CSE 311: Foundations of Computing Fall 2014 Lecture 23: State Minimization, NFAs.

Nondeterministic Finite Automata CS 130: Theory of Computation HMU textbook, Chapter 2 (Sec 2.3 & 2.5)

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

4b 4b Lexical analysis Finite Automata. Finite Automata (FA) FA also called Finite State Machine (FSM) –Abstract model of a computing entity. –Decides.

Decidable Questions About Regular languages 1)Membership problem: “Given a specification of known type and a string w, is w in the language specified?”

Transition Diagrams Lecture 3 Wed, Jan 21, Building Transition Diagrams from Regular Expressions A regular expression consists of symbols a, b,

1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 3 Mälardalen University 2010.

CSCI 2670 Introduction to Theory of Computing October 12, 2005.

Complexity and Computability Theory I Lecture #8 Instructor: Rina Zviel-Girshin Lea Epstein.

Homework 4 due 11/25.

Theory of Computing CSCI 356/541 Lab Session. Outline Lab 1: Finite Automata  Construct and Run Construct and Run  Manipulating Transitions Manipulating.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong DFA minimization.

The decidability of Presburger Arithmetic By Guillermo Guillen 04/13/05 Dr. Smith COT 6421 FIU Spring 2005.

1 Chapter Constructing Efficient Finite Automata.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA.

98 Nondeterministic Automata vs Deterministic Automata We learned that NFA is a convenient model for showing the relationships among regular grammars,

Algorithms for hard problems Automata and tree automata Juris Viksna, 2015.

Jianguo Lu : Lab 3 Jan 30, Winter 2004.

CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.

1 Section 11.3 Constructing Efficient Finite Automata First we’ll see how to transform an NFA into a DFA. Then we’ll see how to transform a DFA into a.

1 Recap lecture 28 Examples of Myhill Nerode theorem, Quotient of a language, examples, Pseudo theorem: Quotient of a language is regular, prefixes of.

 2005 SDU Lecture11 Decidability.  2005 SDU 2 Topics Discuss the power of algorithms to solve problems. Demonstrate that some problems can be solved.

Department of Software & Media Technology

Lexical analysis Finite Automata

CS 461 – Dec. 2 Major results Automata: 3 models of computation

FORMAL LANGUAGES AND AUTOMATA THEORY

Jaya Krishna, M.Tech, Assistant Professor

THEORY OF COMPUTATION Lecture One: Automata Theory Automata Theory.

More on DFA minimization and DFA equivalence

Minimal DFA Among the many DFAs accepting the same regular language L, there is exactly one (up to renaming of states) which has the smallest possible.

Transition Diagrams Lecture 3 Fri, Jan 21, 2005.

4b Lexical analysis Finite Automata

Principles of Computing – UFCFA3-30-1

Chapter 1 Regular Language - 02

4b Lexical analysis Finite Automata

DFA MINIMIZATION Maham Noor 4/8/ Content: Method 1 Equivalence Theorem Method 2 Table filling method 2.

Principles of Computing – UFCFA3-30-1

Regular Language Equivalence and DFA Minimization

Kleene’s Theorem (Part-3)

Part Two : Nondeterministic Finite Automata

Presentation transcript:

CS2303-THEORY OF COMPUTATION www.nskinfo.com && www.nsksofttch.com Department of nskinfo-i education CS2303-THEORY OF COMPUTATION Chapter: Minimization of Automata

Minimized DFA Myhill-Nerode Theorem DFA with minimum number of states that will solve the problem There may be states which are equivalent and not necessary

Equivalent States

Distinguishable States

By default final states of a DFA are distinguishable from non final states Hence in the given DFA, state C is distinguishable from other states To determine whether two states are equivalent we have to analyze the states reachable from the states for various strings from length 0 to some ‘n’ Difficult hence we go for table filling algorithm

Table filling algorithm Build a (n - 1) x (n - 1) table where n is the number of states in the given DFA Each column is named by the name of the states starting with the first state till n-1 states Each row is named with name of the states starting from the second state Duplicate cells are eliminated (i.e.) only one cell is used to determine whether two states are equal

Table filling algorithm Each cell in the table represents a pair of states in the DFA. Cells are marked with a “x” as soon as the two states represented by it are decided to be distinguishable At the end of the process, the pairs of states corresponding to the cells of the table without the mark are concluded as equivalent states

Testing equivalence of two FA To test whether the given two FAs M1 and M2 are equivalent it is imagined as if the two FAs are combined. The imaginary FA will contain m + n states in it where m is the number of states in M1 and n is the number of states in M2. The imaginary FA contains two initial states, initial state of M1 and M2 which is not allowed in real case.

Testing equivalence of two FA Table filling algorithm is used for the imaginary DFA. A table of size (m + n-1) x (m + n-1) is used and the two initial states are tested for equivalence. If they are equivalent then it may be concluded that both the DFAs represent same language.