Nondeterminism. September 7, Nondeterminism
|
|
- Kellie Phillips
- 5 years ago
- Views:
Transcription
1 September 7, 204
2 Introduction is a useful concept that has a great impact on the theory of computation
3 Introduction is a useful concept that has a great impact on the theory of computation So far in our discussion, every step of an Finite Automaton computation follows in a unique way from the preceding step: when the machine is in a given state and reads next input symbol we know what the next state will be
4 Introduction is a useful concept that has a great impact on the theory of computation So far in our discussion, every step of an Finite Automaton computation follows in a unique way from the preceding step: when the machine is in a given state and reads next input symbol we know what the next state will be We call this a deterministic computation. In a nondeterministic computation, choices may exist for the next state at any point
5 How does it occur? is a generalization of determinism; hence, every DFA is a nondeterministic finite automaton, NFA. However, an NFA may have additional features, as N in Figure shows q q ɛ,0 2 q 3 q 4 Figure : Nondeterministic Finite Automaton N
6 DFA versus NFA The difference between a deterministic finite automaton, DFA, and a nondeterministic finite automaton, NFA, is immediately apparent: Every state of DFA always has exactly one exiting transition arrow for each symbol in the alphabet; NFA violates this rule Example: state q in Figure.
7 DFA versus NFA The difference between a deterministic finite automaton, DFA, and a nondeterministic finite automaton, NFA, is immediately apparent: Every state of DFA always has exactly one exiting transition arrow for each symbol in the alphabet; NFA violates this rule Example: state q in Figure. In an NFA a state may have zero, one, or many exiting arrows for each symbol of the alphabet.
8 More differences In a DFA, labels on the transition arrows are symbols of the alphabet; An NFA may have its arrows labeled with symbols of the alphabet or ɛ.
9 More differences In a DFA, labels on the transition arrows are symbols of the alphabet; An NFA may have its arrows labeled with symbols of the alphabet or ɛ. Zero, one, or many arrows may exit from each state with the label ɛ.
10 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel
11 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel Each copy of the machine takes one of the possible ways to proceed and continues as before
12 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel Each copy of the machine takes one of the possible ways to proceed and continues as before If there are subsequent choices, the machine splits again
13 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel Each copy of the machine takes one of the possible ways to proceed and continues as before If there are subsequent choices, the machine splits again If the next input symbol does not appear on any of the arrows exiting the state occupied by a copy of the machine, that copy dies along with the branch of computation associated with it
14 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel Each copy of the machine takes one of the possible ways to proceed and continues as before If there are subsequent choices, the machine splits again If the next input symbol does not appear on any of the arrows exiting the state occupied by a copy of the machine, that copy dies along with the branch of computation associated with it If any one of these copies of the machine is in an accept state at the end of the input, the NFA accepts the input; otherwise it rejects the input
15 How does an NFA compute? Look at NFA N acting on an input: q q ɛ,0 2 q 3 q 4 If N is in state q and the input symbol is the machine split into multiple copies of itself and follows all the possibilities in parallel Each copy of the machine takes one of the possible ways to proceed and continues as before If there are subsequent choices, the machine splits again If the next input symbol does not appear on any of the arrows exiting the state occupied by a copy of the machine, that copy dies along with the branch of computation associated with it If any one of these copies of the machine is in an accept state at the end of the input, the NFA accepts the input; otherwise it rejects the input If a state with an ɛ symbol on some exiting arrow is encountered, the machine split into multiple copies without reading any input.
16 Note on ɛ-transitions The behavior of an NFA on an ɛ-trasition differs from its behavior on non-ɛ transitions because it performs a transtion without reading the input. Hence, when an ɛ-transition is encountered the machine must split. Each copy follows the exiting ɛ labeled arrow, as the one staying to the current state. Then the machine proceeds nondeterministically as before
17 Observations Hence, nondeterminism may be seen as a kind of parallel computation wherein several processes can run concurrently If at least one of these processes accepts then the entire computation accepts.
18 Tree computation Another way to think of a nondeterministic computation is as a tree of possibilities The root of the tree corresponds to the start of the computation Every branching point in the tree corresponds to a point in the computation at which the machine has multiple choices The machine accepts if at least one of the computation branches ends in an accept state as shown in Figure 2
19 Comparison of DFA and NFA Figure 2 : DFA computation NFA computation start start... reject accept or reject accept Deterministic and nondeterministic computations
20 Example run of N q q ɛ,0 2 q 3 q 4 On input 000 start in q and read 0 There is only one place to go on 0: back to q Next, read the symbol. There are two choices: either stay in q or move to q 2. Keep track of possibilities by placing a token on each state where machine can be, i.e., tokens are on q and q 2 An ɛ arrow exits q 2, so the machine splits again: keep on token on q 2 and move the other to q 3
21 Example run, continuation When the third symbol, 0, is read take each token in turn: keep token on q in place, move the token from q 2 to q 3, and remove the previous token from q 3. The last token had no 0 arrow to follow and the corresponding process dies. When the fourth symbol,, is read there are tokens on q and q 3. Thus, split the token on q keeping it on q and q 2 and move the token on q 3 on q 4 ; since there is an ɛ arrow leaving q 2 split the token on q 2 to q 3 too. Now there are tokens on each state. When fifth symbol,, is read the tokens on q and q 3 result in tokens on q, q 2 q 3 and q 4. The previous token on q 2 is removed and the token previously on q 4 stays on q 4
22 Eliminate token duplication There are two valid tokens on q 4. Remove one of them because we only need to remember that q 4 is a possible state at this point, not that it is possible to reach this state for multiple reasons.
23 Example run, continuation When the sixth symbol, 0 is read, keep the token on q in place, move the token from q 2 to q 3, remove previous token from q 3, and leave the token on q 4 on q 4 Now the end of the input is detected, since q 4 has a token and it is final, the input is accepted.
24 Example Consider the NFA N and the string q q ɛ,0 2 q 3 q 4 The itrees in T N w are in Figure 3
25 An NFA tree computation 0 0 q q 3 q q q q 2 ɛ q 3 q2 ɛ q q 3 q 4 0 q q 3 q 4 q 2 ɛ q 3 q 3 q 4 q 4 q 4 Figure 3 : Tree computation performed by N
26 Note N rejects the string 00, as can be seen on Figure 3 By performing other similar experiments we can see that N accepts all strings that contain either 0 or as substrings
27 Why nondeterministic automata Every NFA can be converted into an equivalent DFA
28 Why nondeterministic automata Every NFA can be converted into an equivalent DFA Constructing NFA is sometimes easier than constructing DFA
29 Why nondeterministic automata Every NFA can be converted into an equivalent DFA Constructing NFA is sometimes easier than constructing DFA An NFA may be much smaller than a DFA that performs the same task
30 Why nondeterministic automata Every NFA can be converted into an equivalent DFA Constructing NFA is sometimes easier than constructing DFA An NFA may be much smaller than a DFA that performs the same task NFA provides good introduction to nondeterminism in more powerful computational models
31 Example.30 Let A be the language consisting of all strings over {0, } containing a in the third position from the end, i.e. A = {x {0, } x = s s 2, s 2 = 2} Example: A but 00 A The NFA N 2 in Figure 4 recognizes this language q q 2 q 3 q 4 Figure 4 : The NFA N 2 recognizing A
32 Note N 2 stays in q until it guess that it is three places from the end When it is three places from the end, if it reads a symbol, it branches to q 2 and then uses q 3 and q 4 to check if its guess was correct.
33 A DFA equivalent to N2 As we mentioned earlier, every NFA can be converted into an equivalent DFA Sometimes that DFA may have many more states. The smallest DFA, D 2, equivalent to N 2, in Figure 5, contains 8 states. Note: while understanding the functionality of N 2 is easy, the functionality of D 2 is more difficult to understand
34 The DFA D 2 0 q q 00 0 q 00 q q 00 q 0 q 0 q Figure 5 : DFA D 2 equivalent to NFA N 2 0
35 Problem q q 2,ɛ q 3,ɛ q 4 Figure 6 : The NFA N 2 recognizing A Suppose that we added ɛ to the labels on the arrows going from q 2 to q 3 and from q 3 to q 4 in machine N 2, Figure 4, getting the machine in Figure 6. What language would the new N 2 recognize?
36 Problem q q 2,ɛ q 3,ɛ q 4 Figure 6 : The NFA N 2 recognizing A Suppose that we added ɛ to the labels on the arrows going from q 2 to q 3 and from q 3 to q 4 in machine N 2, Figure 4, getting the machine in Figure 6. What language would the new N 2 recognize? L(N 3 ) = {x {0, } x = s s 2, s 2 2}
37 Problem q q 2,ɛ q 3,ɛ q 4 Figure 6 : The NFA N 2 recognizing A Suppose that we added ɛ to the labels on the arrows going from q 2 to q 3 and from q 3 to q 4 in machine N 2, Figure 4, getting the machine in Figure 6. What language would the new N 2 recognize? L(N 3 ) = {x {0, } x = s s 2, s 2 2} 2. How to modify DFA D 2 in Figure 5 to recognize the same language?
38 Problem q q 2,ɛ q 3,ɛ q 4 Figure 6 : The NFA N 2 recognizing A Suppose that we added ɛ to the labels on the arrows going from q 2 to q 3 and from q 3 to q 4 in machine N 2, Figure 4, getting the machine in Figure 6. What language would the new N 2 recognize? L(N 3 ) = {x {0, } x = s s 2, s 2 2} 2. How to modify DFA D 2 in Figure 5 to recognize the same language? not so easy
39 The use ɛ transitions Consider the NFA N 3 in Figure 7 ɛ ɛ Figure 7 : The NFA N 3
40 The use ɛ transitions Consider the NFA N 3 in Figure 7 ɛ ɛ Figure 7 : The NFA N 3 The NFA N 3 in Figure 7 has a unary input alphabet, {0}
41 The use ɛ transitions Consider the NFA N 3 in Figure 7 ɛ ɛ Figure 7 : The NFA N 3 The NFA N 3 in Figure 7 has a unary input alphabet, {0} N 3 demonstrates the use of ɛ transition for the construction of an NFA that accepts all strings of the form 0 k where k is a multiple of 2 or 3.
42 The use ɛ transitions Consider the NFA N 3 in Figure 7 ɛ ɛ Figure 7 : The NFA N 3 The NFA N 3 in Figure 7 has a unary input alphabet, {0} N 3 demonstrates the use of ɛ transition for the construction of an NFA that accepts all strings of the form 0 k where k is a multiple of 2 or 3. Example: ɛ, 00, 000, are accepted by N 3 but 0, are rejected
43 Note N 3 illustrates a machine operating by initially guessing whether to test one case or another (multiple of 2 or multiple of 3) by branching into either one loop or another and then checking whether it was correct If incorrect the machine reject, if one or both cases are correct, the machine accepts We may try to construct a DFA for this job, but the N 3 is much simpler to understand
44 A working example a q b ɛ a a,b q 2 q 3 Figure 8 : The NFA N 4 This example will be used to illustrate the procedure for the conversion NFA DFA The NFA N 4 to be used to illustrate this procedure is in Figure 8. N 4 accepts strings ɛ, a, baba, baa, etc., but does not accept strings b, bb, babba, etc.
Computer Sciences Department
1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER 3 objectives Finite automaton Infinite automaton Formal definition State diagram Regular and Non-regular
More informationSeptember 7, Formal Definition of a Nondeterministic Finite Automaton
Formal Definition of a Nondeterministic Finite Automaton September 7, 2014 A comment first The formal definition of an NFA is similar to that of a DFA. Both have states, an alphabet, transition function,
More informationChap. 1.2 NonDeterministic Finite Automata (NFA)
Chap. 1.2 NonDeterministic Finite Automata (NFA) DFAs: exactly 1 new state for any state & next char NFA: machine may not work same each time More than 1 transition rule for same state & input Any one
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationCOM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
More informationCSE 311: Foundations of Computing. Lecture 23: Finite State Machine Minimization & NFAs
CSE : Foundations of Computing Lecture : Finite State Machine Minimization & NFAs State Minimization Many different FSMs (DFAs) for the same problem Take a given FSM and try to reduce its state set by
More informationSeptember 11, Second Part of Regular Expressions Equivalence with Finite Aut
Second Part of Regular Expressions Equivalence with Finite Automata September 11, 2013 Lemma 1.60 If a language is regular then it is specified by a regular expression Proof idea: For a given regular language
More informationCSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata (cont )
CSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata (cont ) Sungjin Im University of California, Merced 2-3-214 Example II A ɛ B ɛ D F C E Example II A ɛ B ɛ D F C E NFA accepting
More informationClosure under the Regular Operations
September 7, 2013 Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have shown this closure
More informationTheory of Computation p.1/?? Theory of Computation p.2/?? Unknown: Implicitly a Boolean variable: true if a word is
Abstraction of Problems Data: abstracted as a word in a given alphabet. Σ: alphabet, a finite, non-empty set of symbols. Σ : all the words of finite length built up using Σ: Conditions: abstracted as a
More informationCS 154, Lecture 3: DFA NFA, Regular Expressions
CS 154, Lecture 3: DFA NFA, Regular Expressions Homework 1 is coming out Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY NON-DETERMINISM and REGULAR OPERATIONS THURSDAY JAN 6 UNION THEOREM The union of two regular languages is also a regular language Regular Languages Are
More informationCSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata
CSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata Sungjin Im University of California, Merced 1-27-215 Nondeterminism Michael Rabin and Dana Scott (1959) Michael Rabin Dana
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Not A DFA Does not have exactly one transition from every state on every symbol: Two transitions from q 0 on a No transition from q 1 (on either a or b) Though not a DFA,
More informationIntroduction to Languages and Computation
Introduction to Languages and Computation George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Languages and Computation July 2014
More informationDeterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
Deterministic Finite Automata Non deterministic finite automata Automata we ve been dealing with have been deterministic For every state and every alphabet symbol there is exactly one move that the machine
More informationCS 154. Finite Automata, Nondeterminism, Regular Expressions
CS 54 Finite Automata, Nondeterminism, Regular Expressions Read string left to right The DFA accepts a string if the process ends in a double circle A DFA is a 5-tuple M = (Q, Σ, δ, q, F) Q is the set
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Mahesh Viswanathan Introducing Nondeterminism Consider the machine shown in Figure. Like a DFA it has finitely many states and transitions labeled by symbols from an input
More informationUNIT-III REGULAR LANGUAGES
Syllabus R9 Regulation REGULAR EXPRESSIONS UNIT-III REGULAR LANGUAGES Regular expressions are useful for representing certain sets of strings in an algebraic fashion. In arithmetic we can use the operations
More informationChapter Five: Nondeterministic Finite Automata
Chapter Five: Nondeterministic Finite Automata From DFA to NFA A DFA has exactly one transition from every state on every symbol in the alphabet. By relaxing this requirement we get a related but more
More informationDecision, Computation and Language
Decision, Computation and Language Non-Deterministic Finite Automata (NFA) Dr. Muhammad S Khan (mskhan@liv.ac.uk) Ashton Building, Room G22 http://www.csc.liv.ac.uk/~khan/comp218 Finite State Automata
More informationFinite Automata. Mahesh Viswanathan
Finite Automata Mahesh Viswanathan In this lecture, we will consider different models of finite state machines and study their relative power. These notes assume that the reader is familiar with DFAs,
More informationAutomata: a short introduction
ILIAS, University of Luxembourg Discrete Mathematics II May 2012 What is a computer? Real computers are complicated; We abstract up to an essential model of computation; We begin with the simplest possible
More informationChapter 5. Finite Automata
Chapter 5 Finite Automata 5.1 Finite State Automata Capable of recognizing numerous symbol patterns, the class of regular languages Suitable for pattern-recognition type applications, such as the lexical
More informationTheory of Languages and Automata
Theory of Languages and Automata Chapter 1- Regular Languages & Finite State Automaton Sharif University of Technology Finite State Automaton We begin with the simplest model of Computation, called finite
More informationCS 154. Finite Automata vs Regular Expressions, Non-Regular Languages
CS 154 Finite Automata vs Regular Expressions, Non-Regular Languages Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and guessing
More informationCISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata
CISC 4090: Theory of Computation Chapter Regular Languages Xiaolan Zhang, adapted from slides by Prof. Werschulz Section.: Finite Automata Fordham University Department of Computer and Information Sciences
More informationLecture 3: Nondeterministic Finite Automata
Lecture 3: Nondeterministic Finite Automata September 5, 206 CS 00 Theory of Computation As a recap of last lecture, recall that a deterministic finite automaton (DFA) consists of (Q, Σ, δ, q 0, F ) where
More informationTwo-Way Automata and Descriptional Complexity
Two-Way Automata and Descriptional Complexity Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano TCS 2014 Rome, Italy September 1-3, 2014 IFIP TC1, Working Group 1.2, Descriptional
More informationFinite Automata. Seungjin Choi
Finite Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 / 28 Outline
More informationCS243, Logic and Computation Nondeterministic finite automata
CS243, Prof. Alvarez NONDETERMINISTIC FINITE AUTOMATA (NFA) Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (67) 552-4333
More informationTheory of Computation (I) Yijia Chen Fudan University
Theory of Computation (I) Yijia Chen Fudan University Instructor Yijia Chen Homepage: http://basics.sjtu.edu.cn/~chen Email: yijiachen@fudan.edu.cn Textbook Introduction to the Theory of Computation Michael
More informationFinite Automata Part Two
Finite Automata Part Two DFAs A DFA is a Deterministic Finite Automaton A DFA is defined relative to some alphabet Σ. For each state in the DFA, there must be exactly one transition defined for each symbol
More informationIntro to Theory of Computation
Intro to Theory of Computation 1/19/2016 LECTURE 3 Last time: DFAs and NFAs Operations on languages Today: Nondeterminism Equivalence of NFAs and DFAs Closure properties of regular languages Sofya Raskhodnikova
More informationCS 455/555: Finite automata
CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently
More informationClarifications from last time. This Lecture. Last Lecture. CMSC 330: Organization of Programming Languages. Finite Automata.
CMSC 330: Organization of Programming Languages Last Lecture Languages Sets of strings Operations on languages Finite Automata Regular expressions Constants Operators Precedence CMSC 330 2 Clarifications
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) September,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (D-ITET) September, 24 2015 Last week was all about Deterministic Finite Automaton We saw three main
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Section 1.1 Construct finite automata using algorithms from closure arguments Determine
More informationNondeterminism and Epsilon Transitions
Nondeterminism and Epsilon Transitions Mridul Aanjaneya Stanford University June 28, 22 Mridul Aanjaneya Automata Theory / 3 Challenge Problem Question Prove that any square with side length a power of
More informationFinite Automata. BİL405 - Automata Theory and Formal Languages 1
Finite Automata BİL405 - Automata Theory and Formal Languages 1 Deterministic Finite Automata (DFA) A Deterministic Finite Automata (DFA) is a quintuple A = (Q,,, q 0, F) 1. Q is a finite set of states
More information(Refer Slide Time: 0:21)
Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata
More informationLecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2 Prepared by, Dr. Subhendu Kumar Rath, BPUT, Odisha. UNIT 2 Structure NON-DETERMINISTIC FINITE AUTOMATA
More informationExamples of Regular Expressions. Finite Automata vs. Regular Expressions. Example of Using flex. Application
Examples of Regular Expressions 1. 0 10, L(0 10 ) = {w w contains exactly a single 1} 2. Σ 1Σ, L(Σ 1Σ ) = {w w contains at least one 1} 3. Σ 001Σ, L(Σ 001Σ ) = {w w contains the string 001 as a substring}
More informationCS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1)
CS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1) Definition 1 (Alphabet) A alphabet is a finite set of objects called symbols. Definition 2 (String)
More informationCPS 220 Theory of Computation REGULAR LANGUAGES
CPS 22 Theory of Computation REGULAR LANGUAGES Introduction Model (def) a miniature representation of a thing; sometimes a facsimile Iraq village mockup for the Marines Scientific modelling - the process
More informationNon-deterministic Finite Automata (NFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Non-deterministic Finite Automata (NFAs) Part I NFA Introduction Lecture 4 Thursday, September 7, 27 Sariel Har-Peled (UIUC) CS374 Fall 27 / 39 Sariel
More informationUNIT-II. NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: SIGNIFICANCE. Use of ε-transitions. s t a r t. ε r. e g u l a r
Syllabus R9 Regulation UNIT-II NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite
More informationFormal Definition of Computation. August 28, 2013
August 28, 2013 Computation model The model of computation considered so far is the work performed by a finite automaton Finite automata were described informally, using state diagrams, and formally, as
More information2017/08/29 Chapter 1.2 in Sipser Ø Announcement:
Nondeterministic Human-aware Finite Robo.cs Automata 2017/08/29 Chapter 1.2 in Sipser Ø Announcement: q Piazza registration: http://piazza.com/asu/fall2017/cse355 q First poll will be posted on Piazza
More informationPS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010
University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,
More informationFinite Automata. Finite Automata
Finite Automata Finite Automata Formal Specification of Languages Generators Grammars Context-free Regular Regular Expressions Recognizers Parsers, Push-down Automata Context Free Grammar Finite State
More informationClosure under the Regular Operations
Closure under the Regular Operations Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Lecture 6 Section 2.2 Robb T. Koether Hampden-Sydney College Mon, Sep 5, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Finite Automata Mon, Sep 5, 2016
More informationContext-Free Languages
CS:4330 Theory of Computation Spring 2018 Context-Free Languages Pushdown Automata Haniel Barbosa Readings for this lecture Chapter 2 of [Sipser 1996], 3rd edition. Section 2.2. Finite automaton 1 / 13
More informationInf2A: Converting from NFAs to DFAs and Closure Properties
1/43 Inf2A: Converting from NFAs to DFAs and Stuart Anderson School of Informatics University of Edinburgh October 13, 2009 Starter Questions 2/43 1 Can you devise a way of testing for any FSM M whether
More informationExtended transition function of a DFA
Extended transition function of a DFA The next two pages describe the extended transition function of a DFA in a more detailed way than Handout 3.. p./43 Formal approach to accepted strings We define the
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationFinite Automata Part Two
Finite Automata Part Two Recap from Last Time Old MacDonald Had a Symbol, Σ-eye-ε-ey, Oh! You may have noticed that we have several letter- E-ish symbols in CS103, which can get confusing! Here s a quick
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Review of CFG, CFL, ambiguity What is the language generated by the CFG below: G 1 = ({S,T 1,T 2 }, {0,1,2}, { S
More informationCSC173 Workshop: 13 Sept. Notes
CSC173 Workshop: 13 Sept. Notes Frank Ferraro Department of Computer Science University of Rochester September 14, 2010 1 Regular Languages and Equivalent Forms A language can be thought of a set L of
More informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationRecap DFA,NFA, DTM. Slides by Prof. Debasis Mitra, FIT.
Recap DFA,NFA, DTM Slides by Prof. Debasis Mitra, FIT. 1 Formal Language Finite set of alphabets Σ: e.g., {0, 1}, {a, b, c}, { {, } } Language L is a subset of strings on Σ, e.g., {00, 110, 01} a finite
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Section 1.1 Design an automaton that recognizes a given language. Specify each of
More informationCMPSCI 250: Introduction to Computation. Lecture #22: From λ-nfa s to NFA s to DFA s David Mix Barrington 22 April 2013
CMPSCI 250: Introduction to Computation Lecture #22: From λ-nfa s to NFA s to DFA s David Mix Barrington 22 April 2013 λ-nfa s to NFA s to DFA s Reviewing the Three Models and Kleene s Theorem The Subset
More informationCISC 4090 Theory of Computation
9/2/28 Stereotypical computer CISC 49 Theory of Computation Finite state machines & Regular languages Professor Daniel Leeds dleeds@fordham.edu JMH 332 Central processing unit (CPU) performs all the instructions
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 6 CHAPTER 2 FINITE AUTOMATA 2. Nondeterministic Finite Automata NFA 3. Finite Automata and Regular Expressions 4. Languages
More informationV Honors Theory of Computation
V22.0453-001 Honors Theory of Computation Problem Set 3 Solutions Problem 1 Solution: The class of languages recognized by these machines is the exactly the class of regular languages, thus this TM variant
More informationT (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,
Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the
More informationLecture 4: More on Regexps, Non-Regular Languages
6.045 Lecture 4: More on Regexps, Non-Regular Languages 6.045 Announcements: - Pset 1 is on piazza (as of last night) - If you don t have piazza access but are registered for 6.045, send email to TAs with
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Nondeterministic Finite Automata with empty moves (-NFA) Definition A nondeterministic finite automaton
More informationPlease give details of your answer. A direct answer without explanation is not counted.
Please give details of your answer. A direct answer without explanation is not counted. Your answers must be in English. Please carefully read problem statements. During the exam you are not allowed to
More informationFinite Automata (contd)
Finite Automata (contd) CS 2800: Discrete Structures, Fall 2014 Sid Chaudhuri Recap: Deterministic Finite Automaton A DFA is a 5-tuple M = (Q, Σ, δ, q 0, F) Q is a fnite set of states Σ is a fnite input
More informationfront pad rear pad door
front pad rear pad door REAR BOTH NEITHER closed FRONT open FRONT REAR BOTH NEITHER Think of this as a simple program that outputs one of two values (states) when provided with the current state and an
More informationDeterministic Finite Automaton (DFA)
1 Lecture Overview Deterministic Finite Automata (DFA) o accepting a string o defining a language Nondeterministic Finite Automata (NFA) o converting to DFA (subset construction) o constructed from a regular
More informationCSC236 Week 11. Larry Zhang
CSC236 Week 11 Larry Zhang 1 Announcements Next week s lecture: Final exam review This week s tutorial: Exercises with DFAs PS9 will be out later this week s. 2 Recap Last week we learned about Deterministic
More informationFinite Automata. Dr. Neil T. Dantam. Fall CSCI-561, Colorado School of Mines. Dantam (Mines CSCI-561) Finite Automata Fall / 35
Finite Automata Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Finite Automata Fall 2017 1 / 35 Outline Dantam (Mines CSCI-561) Finite Automata Fall 2017 2 / 35
More informationCSE 105 Theory of Computation Professor Jeanne Ferrante
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Today s agenda NFA Review and Design NFA s Equivalence to DFA s Another Closure Property proof for Regular Languages
More informationCMSC 330: Organization of Programming Languages. Theory of Regular Expressions Finite Automata
: Organization of Programming Languages Theory of Regular Expressions Finite Automata Previous Course Review {s s defined} means the set of string s such that s is chosen or defined as given s A means
More informationFormal Definition of a Finite Automaton. August 26, 2013
August 26, 2013 Why a formal definition? A formal definition is precise: - It resolves any uncertainties about what is allowed in a finite automaton such as the number of accept states and number of transitions
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 23rd September, 2014 1 / 29 1 Closure properties of regular languages
More informationIntroduction to Theory of Computing
CSCI 2670, Fall 2012 Introduction to Theory of Computing Department of Computer Science University of Georgia Athens, GA 30602 Instructor: Liming Cai www.cs.uga.edu/ cai 0 Lecture Note 3 Context-Free Languages
More informationCourse 4 Finite Automata/Finite State Machines
Course 4 Finite Automata/Finite State Machines The structure and the content of the lecture is based on (1) http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm, (2) W. Schreiner Computability and
More informationLecture 17: Language Recognition
Lecture 17: Language Recognition Finite State Automata Deterministic and Non-Deterministic Finite Automata Regular Expressions Push-Down Automata Turing Machines Modeling Computation When attempting to
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 3.3, 4.1 State and use the Church-Turing thesis. Give examples of decidable problems.
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 24 September 2018 1 / 33 Determinization The subset construction
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY THE PUMPING LEMMA FOR REGULAR LANGUAGES and REGULAR EXPRESSIONS TUESDAY Jan 21 WHICH OF THESE ARE REGULAR? B = {0 n 1 n n 0} C = { w w has equal number
More informationTheory of Computation (II) Yijia Chen Fudan University
Theory of Computation (II) Yijia Chen Fudan University Review A language L is a subset of strings over an alphabet Σ. Our goal is to identify those languages that can be recognized by one of the simplest
More informationNondeterministic Finite Automata. Nondeterminism Subset Construction
Nondeterministic Finite Automata Nondeterminism Subset Construction 1 Nondeterminism A nondeterministic finite automaton has the ability to be in several states at once. Transitions from a state on an
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata COMP2600 Formal Methods for Software Engineering Katya Lebedeva Australian National University Semester 2, 206 Slides by Katya Lebedeva. COMP 2600 Nondeterministic Finite
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 2 Define push down automata Trace the computation of a push down automaton Design
More informationAutomata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Spring 27 Alexis Maciel Department of Computer Science Clarkson University Copyright c 27 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
More informationRegular expressions and Kleene s theorem
Regular expressions and Kleene s theorem Informatics 2A: Lecture 5 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 26 September 2018 1 / 18 Finishing DFA minimization An algorithm
More informationDeterministic finite Automata
Deterministic finite Automata Informatics 2A: Lecture 3 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 21 September, 212 1 / 29 1 Languages and Finite State Machines What is
More informationCISC4090: Theory of Computation
CISC4090: Theory of Computation Chapter 2 Context-Free Languages Courtesy of Prof. Arthur G. Werschulz Fordham University Department of Computer and Information Sciences Spring, 2014 Overview In Chapter
More informationTakeaway Notes: Finite State Automata
Takeaway Notes: Finite State Automata Contents 1 Introduction 1 2 Basics and Ground Rules 2 2.1 Building Blocks.............................. 2 2.2 The Name of the Game.......................... 2 3 Deterministic
More informationINF Introduction and Regular Languages. Daniel Lupp. 18th January University of Oslo. Department of Informatics. Universitetet i Oslo
INF28 1. Introduction and Regular Languages Daniel Lupp Universitetet i Oslo 18th January 218 Department of Informatics University of Oslo INF28 Lecture :: 18th January 1 / 33 Details on the Course consists
More informationLet us first give some intuitive idea about a state of a system and state transitions before describing finite automata.
Finite Automata Automata (singular: automation) are a particularly simple, but useful, model of computation. They were initially proposed as a simple model for the behavior of neurons. The concept of a
More information