closed under complementation
play

Closed under complementation Proposition: Let be some finite - PDF document

Feb 14, 2024 •171 likes •268 views

15-251 Great Ideas in Theoretical Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 25th, 2018 Closure properties of regular languages Closed under complementation Proposition: Let be some finite

  1. 15-251 Great Ideas in Theoretical Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 25th, 2018 Closure properties of regular languages Closed under complementation Proposition: Let be some finite alphabet. Σ If is regular, then so is . L ⊆ Σ ∗ L = Σ ∗ \ L Proof:

  2. Closed under union Theorem: Let be some finite alphabet. Σ If and are regular, then so is . L 1 ⊆ Σ ∗ L 2 ⊆ Σ ∗ L 1 ∪ L 2 Proof: The mindset Step 1 : Imagining ourselves as a DFA

  3. Closed under union M 1 Example 0 strings with even q even L 1 = number of 1’s 1 1 strings with length L 2 = divisible by 3. 0 q odd 0 , 1 M 2 p 0 p 1 p 2 0 , 1 0 , 1 Closed under union M 1 Input: 101001 0 q even 1 1 0 q odd 0 , 1 M 2 p 0 p 1 p 2 0 , 1 0 , 1 Closed under union M 1 Input: 101001 0 q even 1 1 Accept 0 q odd 0 , 1 M 2 p 0 p 1 p 2 0 , 1 0 , 1

  4. Closed under union Main idea: M 1 Construct a DFA that keeps track of both at once. 0 q even 1 1 0 q odd 0 , 1 M 2 p 0 p 1 p 2 0 , 1 0 , 1 Closed under union Main idea: Construct a DFA that keeps track of both at once. q even q even q even p 0 p 1 p 2 q odd q odd q odd p 0 p 1 p 2 Step 2 : Formally defining the DFA

  5. Closed under union Proof: Let be a DFA deciding L 1 M = ( Q, Σ , δ , q 0 , F ) M 0 = ( Q 0 , Σ , δ 0 , q 0 and be a DFA deciding . 0 , F 0 ) L 2 We construct a DFA M 00 = ( Q 00 , Σ , δ 00 , q 00 0 , F 00 ) that decides , as follows: L 1 ∪ L 2 More closure properties Closed under union: Closed under concatenation: Closed under star: super awesome vs regular What is the relationship between super awesome and regular ?

  6. super awesome vs regular Theorem: Can define regular languages recursively as follows: Closed under concatenation Theorem: Let be some finite alphabet. Σ If and are regular, then so is . L 1 ⊆ Σ ∗ L 2 ⊆ Σ ∗ L 1 L 2 The mindset Imagine yourself as a DFA. Rules: 1) Can only scan the input once, from left to right. 2) Can only remember “constant” amount of information. should not change based on input length

  7. Step 1 : Imagining ourselves as a DFA M 1 0 1 M 2 q 0 0 0 q 3 q 1 1 0 1 1 0 1 q 0 q 0 0 0 1 1 0 q 0 0 q 2 q 4 2 1 1 Given , we need to decide if w ∈ Σ ∗ for u ∈ L 1 , v ∈ L 2 . w = uv Problem: Don’t know where ends, begins. u v When do you stop simulating and start simulating ? M 1 M 2 M 1 0 1 M 2 q 0 0 0 q 3 q 1 1 0 1 1 0 1 q 0 q 0 0 0 1 1 0 q 0 0 q 2 q 4 2 1 1 Suppose God tells you ends at . u w 3 0 0 1 1 0 0 1 0 0 1 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9 w 10 q 0 q 1 q 1 q 3 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 0 2 2 2 1 2 2 1 thread :

  8. M 1 0 1 automatic M 2 teleportation q 0 0 0 q 3 q 1 1 0 1 1 0 1 q 0 q 0 0 0 1 1 0 q 0 0 q 2 q 4 2 1 1 0 0 1 1 0 0 1 0 0 1 1 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9 w 10 w 11 q 0 q 1 q 1 q 3 q 2 q 4 q 1 q 3 q 1 q 1 q 3 q 2 thread1 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 2 2 1 0 0 2 2 1 2 thread2 q 0 q 0 q 0 q 0 q 0 q 0 q 0 1 0 0 1 0 1 2 thread3 q 0 q 0 q 0 q 0 q 0 1 2 1 0 0 q 0 q 0 thread4 0 2 M 1 0 1 automatic M 2 teleportation q 0 0 0 q 3 q 1 1 0 1 1 0 1 q 0 q 0 0 0 1 1 0 q 0 0 q 2 q 4 2 1 1 0 0 1 1 0 0 1 0 0 1 1 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9 w 10 w 11 q 0 q 1 q 1 q 3 q 2 q 4 q 1 q 3 q 1 q 1 q 3 q 2 thread1 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 2 2 1 0 0 2 2 1 2 thread2 q 0 q 0 q 0 q 0 q 0 q 0 q 0 0 1 0 1 2 1 0 thread3 q 0 q 0 q 0 q 0 q 0 0 2 0 1 1 q 0 q 0 thread4 0 2 0 0 1 1 0 0 1 0 0 1 1 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9 w 10 w 11 q 0 q 1 q 1 q 3 q 2 q 4 q 1 q 3 q 1 q 1 q 3 q 2 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 0 2 2 2 1 2 2 1 0 q 0 q 0 q 0 q 0 q 0 q 0 q 0 0 1 0 1 2 1 0 q 0 q 0 q 0 q 0 q 0 0 1 2 1 0 q 0 q 0 0 2 ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ ⊆ Q 0 Q 0 Q 0 Q 0 Q 0 Q 0 Q 0 Q 0 Q 0 Q 0 Q 0

  9. Step 2 : Formally defining the DFA M 1 = ( Q, Σ , δ , q 0 , F ) M 2 = ( Q 0 , Σ , δ 0 , q 0 0 , F 0 ) Q 00 = δ 00 : q 00 0 = F 00 =

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Example: the binary tree of Example 2.1.2: The outcomes are the 8 possible paths from t = 0

Example: the binary tree of Example 2.1.2: The outcomes are the 8 possible paths from t = 0

Martingales Mathematical background of random variables and stochastic processes: A sample space with outcomes ; A collection of subsets F ; F is a -field; F , and F is closed under complementation and

353 views • 16 slides
B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi

B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi

Automata Theory Seminar B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi Complementation BA B BA B BA: B uchi Automaton 1 / 33 B uchi Complementation 2 ( n log n ) BA B BA B BA: B uchi

1.59k views • 145 slides
B uchi Complementation 2 ( n log n ) BA B BA B Automata Theory Seminar BA: B uchi

B uchi Complementation 2 ( n log n ) BA B BA B Automata Theory Seminar BA: B uchi

B uchi Complementation 2 ( n log n ) BA B BA B Automata Theory Seminar BA: B uchi Automaton B uchi Complementation via AA: Alternating Alternating Automata Automaton AA A AA A Fabian Reiter Expensive: If B has n states, B has 2

333 views • 5 slides
B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi

B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi

Automata Theory Seminar B uchi Complementation via Alternating Automata Fabian Reiter July 16, 2012 B uchi Complementation 2 ( n log n ) BA B BA B BA: B uchi Automaton AA: Alternating Automaton AA A AA A Expensive: If B has n

510 views • 38 slides
Disjointly homogenous Banach lattices: duality and complementation Pedro Tradacete Departamento

Disjointly homogenous Banach lattices: duality and complementation Pedro Tradacete Departamento

Disjointly homogenous Banach lattices: duality and complementation Pedro Tradacete Departamento de Matem aticas Joint work with J. Flores, F. L. Hern andez E. Spinu and V. G. Troitsky Workshop on Functional Analysis on the occasion of the

389 views • 9 slides
Classification of curves Simple, not closed Simple, closed Closed, not simple Not simple, not

Classification of curves Simple, not closed Simple, closed Closed, not simple Not simple, not

Classification of curves Simple, not closed Simple, closed Closed, not simple Not simple, not closed MA202 Sections 5 & 401 Chapter 11-2 Slides Interior and exterior of a simple closed curve MA202 Sections 5 & 401 Chapter 11-2

490 views • 36 slides
I3 I3 A CLOSED SED P PROCESS SS The whole process is one "Closed box", which

I3 I3 A CLOSED SED P PROCESS SS The whole process is one "Closed box", which

I3 I3 A CLOSED SED P PROCESS SS The whole process is one "Closed box", which dewater, dries and hygienizes the sludge via an efficient vacuum filter with added heat. CY CYCL CLE The process creates a cycle of nutrients and

337 views • 6 slides
Complementing Feistel Ciphers Ivica Nikoli c (joint work with Alex Biryukov) Nanyang

Complementing Feistel Ciphers Ivica Nikoli c (joint work with Alex Biryukov) Nanyang

Complementation Property General Complementation Property Application to Camellia-128 Application to GOST Conclusion Complementing Feistel Ciphers Ivica Nikoli c (joint work with Alex Biryukov) Nanyang Technological University, Singapore

426 views • 24 slides
Vector Spaces Sets Closed Under Operations Defn. A set S is closed under some opera- tion if

Vector Spaces Sets Closed Under Operations Defn. A set S is closed under some opera- tion if

Vector Spaces Sets Closed Under Operations Defn. A set S is closed under some opera- tion if applying that operation to elements of S always produces an element of S . For example, the integers are closed under ad- dition: adding two integers

420 views • 14 slides
Closed CTE Program Sites Location Closed Program HVAC Abram Friedman Occupational Center

Closed CTE Program Sites Location Closed Program HVAC Abram Friedman Occupational Center

PATHWAY TO ENGLISH AS A SECOND LANGUAGE Adult Education Ad Hoc Committee Evans Community Adult School November 18, 2013 Donna Brashear Executive Director Division of Adult and Career Education Closed CTE Program Sites Location Closed

498 views • 15 slides
SAF and closed-loop automation Matthias Runge Senior Software Engineer 1 SAF AND CLOSED-LOOP

SAF and closed-loop automation Matthias Runge Senior Software Engineer 1 SAF AND CLOSED-LOOP

SAF and closed-loop automation Matthias Runge Senior Software Engineer 1 SAF AND CLOSED-LOOP AUTOMATION 2 SAF AND CLOSED-LOOP AUTOMATION Architecture for infrastructure metrics & events AMQ 7 Interconnect - Native AMQP 1.0 Message Router

331 views • 8 slides
Session Transcript: 6/26/2020 Closed Captioning/ Transcript Disclaimer Closed captioning and/or

Session Transcript: 6/26/2020 Closed Captioning/ Transcript Disclaimer Closed captioning and/or

Session Transcript: 6/26/2020 Closed Captioning/ Transcript Disclaimer Closed captioning and/or transcription is being provided solely for the convenience of our viewers. Yoga Alliance does not review for accuracy any information that appears in

291 views • 3 slides
YogaAlliance - Zoom webinar (USYOGA1906A) Closed Captioning/ Transcript Disclaimer Closed

YogaAlliance - Zoom webinar (USYOGA1906A) Closed Captioning/ Transcript Disclaimer Closed

YogaAlliance - Zoom webinar (USYOGA1906A) Closed Captioning/ Transcript Disclaimer Closed captioning and/or transcription is being provided solely for the convenience of our viewers. Yoga Alliance does not review for accuracy any information

130 views • 9 slides
Session Transcript: 6/25/2020 - Afternoon Closed Captioning/ Transcript Disclaimer Closed

Session Transcript: 6/25/2020 - Afternoon Closed Captioning/ Transcript Disclaimer Closed

Session Transcript: 6/25/2020 - Afternoon Closed Captioning/ Transcript Disclaimer Closed captioning and/or transcription is being provided solely for the convenience of our viewers. Yoga Alliance does not review for accuracy any information

264 views • 10 slides
YogaAlliance - YA Community Sangha (USYOGA1307A) Closed Captioning/ Transcript Disclaimer Closed

YogaAlliance - YA Community Sangha (USYOGA1307A) Closed Captioning/ Transcript Disclaimer Closed

YogaAlliance - YA Community Sangha (USYOGA1307A) Closed Captioning/ Transcript Disclaimer Closed captioning and/or transcription is being provided solely for the convenience of our viewers. Yoga Alliance does not review for accuracy any

108 views • 7 slides
Closed-End Fund Advisors Diversification, Income, & Tactical Management Introduction to

Closed-End Fund Advisors Diversification, Income, & Tactical Management Introduction to

Closed-End Fund Advisors Diversification, Income, & Tactical Management Introduction to Closed-End Funds / VCU MBA Capital Markets Class November 18, 2010 Todays Goal To give you an overview on closed- end funds and how to

397 views • 28 slides
Logic, Automata, Games, and Algorithms Moshe Y. Vardi Rice University Two Separate Paradigms in

Logic, Automata, Games, and Algorithms Moshe Y. Vardi Rice University Two Separate Paradigms in

Logic, Automata, Games, and Algorithms Moshe Y. Vardi Rice University Two Separate Paradigms in Mathematical Logic Paradigm I : Logic declarative formalism Specify properties of mathematical objects, e.g., ( x, y, x )( mult ( x,

1.37k views • 83 slides
From Pivot and Complement to the Feasibility Pump Andrea Lodi Canada Excellence Research Chair

From Pivot and Complement to the Feasibility Pump Andrea Lodi Canada Excellence Research Chair

From Pivot and Complement to the Feasibility Pump Andrea Lodi Canada Excellence Research Chair Ecole Polytechnique de Montr eal, Qu ebec, Canada andrea.lodi@polymtl.ca Discrepancy Theory & Integer Programming Workshop June 11,

1.03k views • 64 slides
5.2: Closure Properties of Recursive and Recursively Enumerable Languages In this section, we

5.2: Closure Properties of Recursive and Recursively Enumerable Languages In this section, we

5.2: Closure Properties of Recursive and Recursively Enumerable Languages In this section, we will see that the recursive and recursively enumerable languages are closed under union, concatenation, closure and intersection. The recursive

376 views • 10 slides
Syntax Valency Jirka Hana Jirka Hana Syntax Valency Grammatical Roles Adjunct versus

Syntax Valency Jirka Hana Jirka Hana Syntax Valency Grammatical Roles Adjunct versus

Grammatical Roles Deep Valency Syntax Valency Jirka Hana Jirka Hana Syntax Valency Grammatical Roles Adjunct versus Complement Deep Valency Transitive and intransitive verbs Grammatical Roles subject (podm et) object (p

403 views • 21 slides
Fuzzifying Modal Algebra Jules Desharnais, Bernhard M oller Universit e Laval Qu ebec,

Fuzzifying Modal Algebra Jules Desharnais, Bernhard M oller Universit e Laval Qu ebec,

Fuzzy Modalities Fuzzifying Modal Algebra Jules Desharnais, Bernhard M oller Universit e Laval Qu ebec, University of Augsburg RAMiCS 2014 J. Desharnais/B. M oller RAMiCS 2014 Why? Why? basic idea: bring together the concepts of

445 views • 31 slides
Complementing Bchi automata via alternating automata Guillaume Sadegh LRDE EPITA Research

Complementing Bchi automata via alternating automata Guillaume Sadegh LRDE EPITA Research

Introduction Overview on -automata The complementation Implementation Conclusion and Perspectives References Complementing Bchi automata via alternating automata Guillaume Sadegh LRDE EPITA Research and Development Laboratory

512 views • 49 slides
The Inclusion Problem for Weighted Automata on Infinite Trees (Slides) Data August 2011

The Inclusion Problem for Weighted Automata on Infinite Trees (Slides) Data August 2011

See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/236590870 The Inclusion Problem for Weighted Automata on Infinite Trees (Slides) Data August 2011 CITATIONS READS 0 30 2 authors:

630 views • 45 slides
Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction Alexey

Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction Alexey

Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction Alexey Bakhirkin 1 Josh Berdine 2 Nir Piterman 1 1 University of Leicester, Department of Computer Science 2 Microsoft Research Goal A backwards analysis

733 views • 23 slides

More recommend