CS 322 D: Formal languages and automata theory
|
|
- Lester Robbins
- 5 years ago
- Views:
Transcription
1 CS 322 D: Formal languages and automata theory Tutorial NFA DFA Regular Expression T. Najla Arfawi 2 nd Term - 26
2 Finite Automata Finite Automata. Q - States 2. S - Alphabets 3. d - Transitions 4. q - Initial state 5. F - Final state(s) / Accepting state(s) 2 T. Najla Arfawi - 2nd Term 26
3 Deterministic Finite Automata There must be a transition corresponding to each alphabet at each state 3 T. Najla Arfawi - 2nd Term 26
4 Nondeterministic Finite Automata Can be at multiple states at the same time Can go to multiple states on one alphabet May have no transitions on an alphabet (die) Every NFA can be converted into a DFA for the same language. 4 T. Najla Arfawi - 2nd Term 26
5 NFA DFA in two easy steps ➊ Eliminate e-transitions ➋ Convert simplified NFA We do this first 5 T. Najla Arfawi - 2nd Term 26
6 NFA DFA: states, NFA: q q q 2 DFA: {q } {q, q } {q } {q, q 2 } {q, q, q 2 } {q 2 } {q, q 2 } DFA has a state for every subset of NFA states 6 T. Najla Arfawi - 2nd Term 26
7 NFA DFA: transitions, NFA: q q q 2 DFA:, {q } {q } {q, q } {q, q 2 } {q, q, q 2 } {q 2 } {q, q 2 } 7 T. Najla Arfawi - 2nd Term 26
8 NFA DFA: accepting states, NFA: q q q 2 DFA:, {q } {q } {q, q } {q, q 2 } {q, q, q 2 } {q 2 } {q, q 2 } NFA accepts if it contains a DFA final state 8 T. Najla Arfawi - 2nd Term 26
9 NFA DFA: dead state elimination, NFA: q q q 2 DFA:, {q } {q } {q, q } {q, q 2 } {q, q, q 2 } {q 2 } {q, q 2 } At the end, you can eliminate the unreachable states 9 T. Najla Arfawi - 2nd Term 26
10 General method NFA DFA states q, q,, q n q }, {q }, {q,q },, {q,,q n } initial state q q } one for each subset of states in the NFA transitions d d ({q i,,q ik }, a) = accepting states d(q i, a) d(q ik, a) F Q F = {S: S contains some state in F} T. Najla Arfawi - 2nd Term 26
11 NFA DFA in two easy steps ➊ Eliminate e-transitions ➋ Convert simplified NFA T. Najla Arfawi - 2nd Term 26
12 Eliminating e-transitions NFA: e, q q q 2 e NFA without es: q q q 2 {q, q, q 2 } {q, q, q 2 } {q, q 2 } Accepting states: q 2, q, q 2 T. Najla Arfawi - 2nd Term 26
13 Eliminating e-transitions NFA: e, q q q 2 e new NFA: q q q 2 {q, q, q 2 } {q, q, q 2 } {q, q 2 } 3 T. Najla Arfawi - 2nd Term 26, q q q 2,
14 Eliminating e-transitions Paths with es are replaced by a single transition q e 5 q a q e 2 q e q 3 q 3 e q 4 a e q5 q a 5 q 3 States that can reach final state by e are all accepting q 3 a 4 T. Najla Arfawi - 2nd Term 26 q 9 q 7 e q 3 e q 2 e
15 Regular Expression The symbols and e are regular expressions Every a in S is a regular expression If R and S are regular expressions, so are RUS, RS and R* Remember for R*, * could be 5 T. Najla Arfawi - 2nd Term 26
16 Regular Languages Languages that can be represented by a DFA / NFA / RE DFA = NFA = RE (in term of equivalence) When asked if a language L is regular, represent L using a DFA / NFA / RE 6 T. Najla Arfawi - 2nd Term 26
17 Checklist. Always pay attention to S 2. For DFA, out degree of each state must be equal S e.g. S = {,, 2}, L = {w: w begins with } 3. For NFA, pay attention to e-transitions 4. Remember to specify the initial state 5. Make sure you have considered the input e e.g. L = {w: w contains even number of } 7 T. Najla Arfawi - 2nd Term 26
18 Exercise S = {, } L = {w: w is non-empty and the sum of the digits in w is divisible by 5} 8 T. Najla Arfawi - 2nd Term 26
19 Idea Need to keep track of the sum of digits Arrive at the state q k when sum of digits = k q q q 2 q 3 q 4 q 5 9 T. Najla Arfawi - 2nd Term 26
20 Idea Need to keep track of the sum of digits Arrive at the state q k when sum of digits = k k divisible by 5 iff k mod 5 = Keep track of the remainder instead q q q 2 q 3 q 4 2 T. Najla Arfawi - 2nd Term 26
21 Answer Handle the input e q s q q q 2 q 3 q 4 2 T. Najla Arfawi - 2nd Term 26
22 Converting an NFA to a DFA Eliminate e q q e q 2 for each state i for each alphabet x for each state j q q q 2 if i can reach j using one x and e(s) add an edge from i to j with label x e q q q 2 q q q 2 22 e q q q 2 T. Najla Arfawi - 2nd Term 26 e q 3 q q q 2 q 3
23 Converting an NFA to a DFA Eliminate e Remember to consider the case when the initial state can reach accepting states on e(s) e q q q 2 q q q 2 23 T. Najla Arfawi - 2nd Term 26
24 Converting an NFA to a DFA Every possible subsets of Q is a state in the DFA Going to multiple states at the same time in the NFA = going to a subset of Q, which is now a state in the DFA q q q 2 {q } {q, q 2 } 24 T. Najla Arfawi - 2nd Term 26
25 Exercise q e q, q 2 25 T. Najla Arfawi - 2nd Term 26
26 Eliminating e-transitions q can reach q on (q -> q -> q ) q can reach q on (q -> q ) q can reach q on (q -> q ) q can reach q on (q -> q ) The rest of the transitions remain unchanged q e q q q, q q 2, q q, q q 2 q q, q 2 26 q 2 T. Najla Arfawi - 2nd Term 26
27 Eliminating e-transitions q is the initial state q can reach an accepting state on e (i.e. q ) therefore q is also an accepting state q q, q q 2 q q, q q e q q q q 2 q q, q 2,, 27 T. Najla Arfawi - 2nd Term 26 q 2 q 2
28 Converting NFA to DFA {q } {q, q } {q 2 } {q } {q, q } {q 2 } {q } {q, q 2 } q q, q 2 28 T. Najla Arfawi - 2nd Term 26
29 Converting NFA to DFA Starting from initial state {q } {q } {q, q } {q 2 } {q } {q, q } {q 2 } {q } {q, q 2 } {q } {q, q } {q 2 } 29 T. Najla Arfawi - 2nd Term 26
30 Converting NFA to DFA Check if every state has S outgoing transitions No Fix {q 2 } and {q, q } {q, q } goes to {q, q } {q, q } = {q, q } on {q, q } goes to {q 2 } = {q 2 } on {q } {q, q } {q } {q, q } {q 2 } {q } {q, q } {q 2 } {q } {q, q 2 } {q } {q 2 } 3 T. Najla Arfawi - 2nd Term 26 {q, q 2 }
31 Converting NFA to DFA Check if every state has S outgoing transitions No Fix {q } and {q, q 2 } {q, q 2 } goes to {q, q } {q } = {q, q } on {q, q 2 } goes to {q, q 2 } = {q, q 2 } on {q } {q, q } {q 2 } {q } {q, q } {q 2 } {q } {q, q 2 } {q } {q, q } {q 2 } {q } 3 T. Najla Arfawi - 2nd Term 26 {q, q 2 }
32 Converting NFA to DFA Check if every state has S outgoing transitions No Fix = die {q } {q, q } {q } {q, q } {q 2 } {q } {q, q } {q } {q 2 } {q } {q, q 2 } {q, 2 } 32 T. Najla Arfawi - 2nd Term 26 {q, q 2 }
33 Converting NFA to DFA Check if every state has S outgoing transitions Yes Accepting states = states that contain q or q q q, q 2 {q } {q, q } {q 2 } {q } {q, q } {q 2 } {q } {q, q 2 } {q } {q, q } {q 2 } {q }, 33 T. Najla Arfawi - 2nd Term 26 {q, q 2 }
34 Converting NFA to DFA Done q e q {q } {q, q }, q 2 {q 2 } {q }, {q, q 2 } 34 T. Najla Arfawi - 2nd Term 26
35 Regular expressions 35 T. Najla Arfawi - 2nd Term 26
36 String concatenation s = abb t = bab st st = abbbab abbbab ts ts = bababb bababb ss ss = abbabb abbabb sst sst = abbabbbab abbabbbab s = x x n t = y y m st = x x n y y m 36 T. Najla Arfawi - 2nd Term 26
37 Operations on languages The concatenation of languages L and L 2 is The n-th power of L n is The union of L and L 2 is L L 2 = {st: s L, t L 2 } L n = {s s 2...s n : s, s 2,..., s n L} L L 2 = {s: s L or s L 2 } 37 T. Najla Arfawi - 2nd Term 26
38 Operations on languages The star of L are all strings made up of zero or more chunks from L: L * = L L L 2 Example: L = {, }, L 2 = {e,,,, }. What is L * and L 2*? 38 T. Najla Arfawi - 2nd Term 26
39 Example L = {, } L * : is in L * is not in L * L = {e} L = {, } L 2 = {,,, } L 3 = {,,,,,,, } is not in L * L * are all strings that start with and do not contain consecutive s (plus the empty string) 39 T. Najla Arfawi - 2nd Term 26
40 Example L 2 = {e,,,, } any number of s L 2 = {e} L 2 * = L 2 L 2 L 2 2 L 2 = L 2 L 2 2 = L 2 L 2 n = L 2 (n ) = {e} L 2 L 2 2 = L 2 L 2 * = L 2 4 T. Najla Arfawi - 2nd Term 26
41 Combining languages We can construct languages by starting with simple ones, like {}, {} and combining them {}({} {})* ( + )* all strings that start with ({}{}*) ({}{}*) * + * followed by any number of s, or followed by any number of s 4 T. Najla Arfawi - 2nd Term 26
42 Regular expressions A regular expression over S is an expression formed using the following rules: The symbols and e are regular expressions Every a in S is a regular expression If R and S are regular expressions, so are R+S, RS and R*. + is union operator U A language is regular if it is represented by a regular expression 42 T. Najla Arfawi - 2nd Term 26
43 Analyzing regular expressions S = {, } * = (*) = {,,,, } followed by any number of s (*)() = {,,,, } followed by any number of s and then 43 T. Najla Arfawi - 2nd Term 26
44 Analyzing regular expressions + = {, } strings of length (+)* = {e,,,,,,, } any string (+)* any string that ends in (+)*(+)* any string that contatins the pattern 44 T. Najla Arfawi - 2nd Term 26
45 Analyzing regular expressions ((+)(+))*+((+)(+)(+))* all strings whose length is even or a mutliple of 3 = strings of length, 2, 3, 4, 6, 8, 9,, 2,... ((+)(+))* strings of even length (+)(+) strings of length 2 ((+)(+)(+))* strings of length a multiple of 3 (+)(+)(+) strings of length 3 45 T. Najla Arfawi - 2nd Term 26
46 Analyzing regular expressions ((+)(+)+(+)(+)(+))* strings that can be broken in blocks, where each block has length 2 or 3 (+)(+)+(+)(+)(+) strings of length 2 or 3 (+)(+) (+)(+)(+) strings of length 2 strings of length 3 46 T. Najla Arfawi - 2nd Term 26
47 Analyzing regular expressions ((+)(+)+(+)(+)(+))* strings that can be broken in blocks, where each block has length 2 or 3 e this includes all strings except those of length ((+)(+)+(+)(+)(+))* = all strings except and 47 T. Najla Arfawi - 2nd Term 26
48 Analyzing regular expressions (++)*(e++) ends in at most two s there can be at most two s between consecutive s there are never three consecutive s Guess: (++)*(e++) = {x: x does not contain } e 48 T. Najla Arfawi - 2nd Term 26
49 Writing regular expressions Write a regular expression for all strings with two consecutive s. S = {, } (anything) (anything else) (+)*(+)* 49 T. Najla Arfawi - 2nd Term 26
50 Writing regular expressions Write a regular expression for all strings that do not contain two consecutive s. S = {, } some s at every maybe a at the end the beginning followed by one or more s... every middle followed by one or more s... and at most one in the last block (*) (e + ) *(*)*(e + ) 5 T. Najla Arfawi - 2nd Term 26
51 Writing regular expressions Write a regular expression for all strings with an even number of s. S = {, } even number of zeros = (two zeros)* two zeros = *** (***)* 5 T. Najla Arfawi - 2nd Term 26
Deterministic 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 informationClosure Properties of Regular Languages. Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism
Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Properties Recall a closure property is a statement
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 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 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 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 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 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 informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Theory of Regular Expressions DFAs and NFAs Reminders Project 1 due Sep. 24 Homework 1 posted Exam 1 on Sep. 25 Exam topics list posted Practice homework
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 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 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 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 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 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 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 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 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 informationCS 154 Formal Languages and Computability Assignment #2 Solutions
CS 154 Formal Languages and Computability Assignment #2 Solutions Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak www.cs.sjsu.edu/~mak Assignment #2: Question 1
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 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 informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, September 5, 27 Sariel Har-Peled (UIUC) CS374 Fall 27 / 36 Part I DFA Introduction Sariel
More informationEquivalence of DFAs and NFAs
CS 172: Computability and Complexity Equivalence of DFAs and NFAs It s a tie! DFA NFA Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum What we ll do today Prove that DFAs
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 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 informationChapter 6: NFA Applications
Chapter 6: NFA Applications Implementing NFAs The problem with implementing NFAs is that, being nondeterministic, they define a more complex computational procedure for testing language membership. To
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 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 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 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 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 informationCS 482 Problem Set 2 Solutions Dan FitzGerald, dpf7
CS 482 Problem Set 2 Solutions Dan FitzGerald, dpf7 Question : Describe the set { n 2n n } intersect { n 2n n }. Are there any strings with an odd number of blocks of zeros? Solution: Since we are dealing
More informationDeterministic Finite Automata (DFAs)
CS/ECE 374: Algorithms & Models of Computation, Fall 28 Deterministic Finite Automata (DFAs) Lecture 3 September 4, 28 Chandra Chekuri (UIUC) CS/ECE 374 Fall 28 / 33 Part I DFA Introduction Chandra Chekuri
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 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 informationFigure 1: NFA N. Figure 2: Equivalent DFA N obtained through function nfa2dfa
CS 3100 Models of Computation Fall 2011 FIRST MIDTERM CLOSED BOOK 100 points I ve standardized on @ for representing Epsilons in all my figures as well as my code (liked equally by dot and our Python programs).
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 informationRegular Language Equivalence and DFA Minimization. Equivalence of Two Regular Languages DFA Minimization
Regular Language Equivalence and DFA Minimization Equivalence of Two Regular Languages DFA Minimization Decision Property: Equivalence Given regular languages L and M, is L = M? Algorithm involves constructing
More informationSri vidya college of engineering and technology
Unit I FINITE AUTOMATA 1. Define hypothesis. The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order
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 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 informationLanguages. Non deterministic finite automata with ε transitions. First there was the DFA. Finite Automata. Non-Deterministic Finite Automata (NFA)
Languages Non deterministic finite automata with ε transitions Recall What is a language? What is a class of languages? Finite Automata Consists of A set of states (Q) A start state (q o ) A set of accepting
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 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 informationAutomata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Fall 28 Alexis Maciel Department of Computer Science Clarkson University Copyright c 28 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
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 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 informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures and Instructions 23.10. 3.11. 17.11. 24.11. 1.12. 11.12.
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 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 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 informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Spring 29 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, January 22, 29 L A TEXed: December 27, 28 8:25 Chan, Har-Peled, Hassanieh (UIUC) CS374 Spring
More informationHKN CS/ECE 374 Midterm 1 Review. Nathan Bleier and Mahir Morshed
HKN CS/ECE 374 Midterm 1 Review Nathan Bleier and Mahir Morshed For the most part, all about strings! String induction (to some extent) Regular languages Regular expressions (regexps) Deterministic finite
More informationFINITE STATE MACHINES (AUTOMATA)
FINITE STATE MACHINES (AUTOMATA) Switch Example Think about the On/Off button Switch Example The corresponding Automaton Off Push On Push Input: Push Push Push Push Vending Machine Example 2 Vending machine
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
More informationTDDD65 Introduction to the Theory of Computation
TDDD65 Introduction to the Theory of Computation Lecture 2 Gustav Nordh, IDA gustav.nordh@liu.se 2012-08-31 Outline - Lecture 2 Closure properties of regular languages Regular expressions Equivalence of
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 informationNondeterminism. September 7, Nondeterminism
September 7, 204 Introduction is a useful concept that has a great impact on the theory of computation Introduction is a useful concept that has a great impact on the theory of computation So far in our
More informationFinite-State Machines (Automata) lecture 12
Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,
More informationFalse. They are the same language.
CS 3100 Models of Computation Fall 2010 Notes 8, Posted online: September 16, 2010 These problems will be helpful for Midterm-1. More solutions will be worked out. The midterm exam itself won t be this
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 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 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 informationCONCATENATION AND KLEENE STAR ON DETERMINISTIC FINITE AUTOMATA
1 CONCATENATION AND KLEENE STAR ON DETERMINISTIC FINITE AUTOMATA GUO-QIANG ZHANG, XIANGNAN ZHOU, ROBERT FRASER, LICONG CUI Department of Electrical Engineering and Computer Science, Case Western Reserve
More informationCS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 2 January 5, 2018 January 5, 2018 CS21 Lecture 2 1 Outline Finite Automata Nondeterministic Finite Automata Closure under regular operations NFA, FA equivalence
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan FINITE STATE MACHINES (AUTOMATA) Switch Example Think about the On/Off button Switch Example The corresponding
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 informationAutomata and Formal Languages - CM0081 Non-Deterministic Finite Automata
Automata and Formal Languages - CM81 Non-Deterministic Finite Automata Andrés Sicard-Ramírez Universidad EAFIT Semester 217-2 Non-Deterministic Finite Automata (NFA) Introduction q i a a q j a q k The
More informationRegular Expressions and Language Properties
Regular Expressions and Language Properties Mridul Aanjaneya Stanford University July 3, 2012 Mridul Aanjaneya Automata Theory 1/ 47 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),
More informationComputational Models #1
Computational Models #1 Handout Mode Nachum Dershowitz & Yishay Mansour March 13-15, 2017 Nachum Dershowitz & Yishay Mansour Computational Models #1 March 13-15, 2017 1 / 41 Lecture Outline I Motivation
More informationCS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 3 January 9, 2017 January 9, 2017 CS21 Lecture 3 1 Outline NFA, FA equivalence Regular Expressions FA and Regular Expressions January 9, 2017 CS21 Lecture 3 2
More informationPushdown automata. Twan van Laarhoven. Institute for Computing and Information Sciences Intelligent Systems Radboud University Nijmegen
Pushdown automata Twan van Laarhoven Institute for Computing and Information Sciences Intelligent Systems Version: fall 2014 T. van Laarhoven Version: fall 2014 Formal Languages, Grammars and Automata
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 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 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 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 informationUses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
More informationNFA and regex. the Boolean algebra of languages. regular expressions. Informatics 1 School of Informatics, University of Edinburgh
NFA and regex cl the Boolean algebra of languages regular expressions Informatics The intersection of two regular languages is regular L = even numbers L = odd numbers L = mod L = mod Informatics The intersection
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 informationFinite Automata and Formal Languages
Finite Automata and Formal Languages TMV26/DIT32 LP4 2 Lecture 6 April 5th 2 Regular expressions (RE) are an algebraic way to denote languages. Given a RE R, it defines the language L(R). Actually, they
More informationCSE 311 Lecture 25: Relating NFAs, DFAs, and Regular Expressions. Emina Torlak and Kevin Zatloukal
CSE 3 Lecture 25: Relating NFAs, DFAs, and Regular Expressions Emina Torlak and Kevin Zatloukal Topics From regular expressions to NFAs Theorem, algorithm, and examples. From NFAs to DFAs Theorem, algorithm,
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 informationEquivalence of Regular Expressions and FSMs
Equivalence of Regular Expressions and FSMs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Regular Language Recall that a language
More informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, September 5, 27 Part I DFA Introduction Sariel Har-Peled (UIUC) CS374 Fall 27 / 36 Sariel
More informationTheory of Computation
Theory of Computation COMP363/COMP6363 Prerequisites: COMP4 and COMP 6 (Foundations of Computing) Textbook: Introduction to Automata Theory, Languages and Computation John E. Hopcroft, Rajeev Motwani,
More informationFooling Sets and. Lecture 5
Fooling Sets and Introduction to Nondeterministic Finite Automata Lecture 5 Proving that a language is not regular Given a language, we saw how to prove it is regular (union, intersection, concatenation,
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 informationHomework 02 Solution updated
CS3-Automata and Complexity Theory Homework 2 Solution updated Due On: 5hrs Wednesday, December 2, 25 Max Points: 25 Problem [5+5+5+ points] Give DFA for the following languages, over the alphabet {,}
More informationGreat Theoretical Ideas in Computer Science. Lecture 4: Deterministic Finite Automaton (DFA), Part 2
5-25 Great Theoretical Ideas in Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 26th, 27 Formal definition: DFA A deterministic finite automaton (DFA) M =(Q,,,q,F) M is
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 informationLecture 1: Finite State Automaton
Lecture 1: Finite State Automaton Instructor: Ketan Mulmuley Scriber: Yuan Li January 6, 2015 1 Deterministic Finite Automaton Informally, a deterministic finite automaton (DFA) has finite number of s-
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 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 informationTheory of Computation
Fall 2002 (YEN) Theory of Computation Midterm Exam. Name:... I.D.#:... 1. (30 pts) True or false (mark O for true ; X for false ). (Score=Max{0, Right- 1 2 Wrong}.) (1) X... If L 1 is regular and L 2 L
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 informationCS 121, Section 2. Week of September 16, 2013
CS 121, Section 2 Week of September 16, 2013 1 Concept Review 1.1 Overview In the past weeks, we have examined the finite automaton, a simple computational model with limited memory. We proved that DFAs,
More informationNondeterministic Finite Automata and Regular Expressions
Nondeterministic Finite Automata and Regular Expressions CS 2800: Discrete Structures, Spring 2015 Sid Chaudhuri Recap: Deterministic Finite Automaton A DFA is a 5-tuple M = (Q, Σ, δ, q 0, F) Q is a finite
More informationName: Student ID: Instructions:
Instructions: Name: CSE 322 Autumn 2001: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions, 20 points each. Time: 50 minutes 1. Write your name and student
More informationPushdown Automata (2015/11/23)
Chapter 6 Pushdown Automata (2015/11/23) Sagrada Familia, Barcelona, Spain Outline 6.0 Introduction 6.1 Definition of PDA 6.2 The Language of a PDA 6.3 Euivalence of PDA s and CFG s 6.4 Deterministic PDA
More informationCompiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compiler Design Spring 2011 Lexical Analysis Sample Exercises and Solutions Prof. Pedro C. Diniz USC / Information Sciences Institute 4676 Admiralty Way, Suite 1001 Marina del Rey, California 90292 pedro@isi.edu
More information