Regular Languages Closed Under Union/Intersection (Product Construction)
19.6 هزار بار بازدید -
4 سال پیش
-
Here we show how to
Here we show how to achieve closure under union for regular languages, with the so-called "product construction". The idea is to "simulate" two given DFAs at the same time, because the input can only be read once. The resulting DFA has pairs of states for each of the original states in both DFAs, and transitions between them based on how the original DFAs had transitions.
Contribute:
Patreon: Patreon: easytheory
Discord: Discord: discord
Live Streaming (Sundays 2PM GMT):
Twitch: Twitch: easytheory
(Youtube also)
Mixer: https://mixer.com/easytheory
Social Media:
Facebook Page: Facebook: easytheory
Facebook group: Facebook: easytheory
Twitter: Twitter: EasyTheory
Merch:
Language Hierarchy Apparel: https://teespring.com/language-hierar...
Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f...
If you like this content, please consider subscribing to my channel: @easytheory
▶ADDITIONAL QUESTIONS◀
1. How can you show regular languages are closed under intersection?
2. Find two DFAs whose "product construction" DFA has the smallest number of states possible for that language, and another two where the resulting DFA does not.
3. How many final states are in the union-ed DFA?
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory.
▶ABOUT THIS CHANNEL◀
The theory of computation is perhaps the fundamental theory of computer science. It sets out to define, mathematically, what exactly computation is, what is feasible to solve using a computer, and also what is not possible to solve using a computer. The main objective is to define a computer mathematically, without the reliance on real-world computers, hardware or software, or the plethora of programming languages we have in use today. The notion of a Turing machine serves this purpose and defines what we believe is the crux of all computable functions.
This channel is also about weaker forms of computation, concentrating on two classes: regular languages and context-free languages. These two models help understand what we can do with restricted means of computation, and offer a rich theory using which you can hone your mathematical skills in reasoning with simple machines and the languages they define.
However, they are not simply there as a weak form of computation--the most attractive aspect of them is that problems formulated on them are tractable, i.e. we can build efficient algorithms to reason with objects such as finite automata, context-free grammars and pushdown automata. For example, we can model a piece of hardware (a circuit) as a finite-state system and solve whether the circuit satisfies a property (like whether it performs addition of 16-bit registers correctly). We can model the syntax of a programming language using a grammar, and build algorithms that check if a string parses according to this grammar.
On the other hand, most problems that ask properties about Turing machines
are undecidable. This Youtube channel will help you see and prove that several tasks involving Turing machines are unsolvable---i.e., no computer, no software, can solve it. For example, you will see that there is no software that can check whether a
C program will halt on a particular input. To prove something is possible is, of course, challenging. But to show something is impossible is rare in computer
science, and very humbling.
Contribute:
Patreon: Patreon: easytheory
Discord: Discord: discord
Live Streaming (Sundays 2PM GMT):
Twitch: Twitch: easytheory
(Youtube also)
Mixer: https://mixer.com/easytheory
Social Media:
Facebook Page: Facebook: easytheory
Facebook group: Facebook: easytheory
Twitter: Twitter: EasyTheory
Merch:
Language Hierarchy Apparel: https://teespring.com/language-hierar...
Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f...
If you like this content, please consider subscribing to my channel: @easytheory
▶ADDITIONAL QUESTIONS◀
1. How can you show regular languages are closed under intersection?
2. Find two DFAs whose "product construction" DFA has the smallest number of states possible for that language, and another two where the resulting DFA does not.
3. How many final states are in the union-ed DFA?
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory.
▶ABOUT THIS CHANNEL◀
The theory of computation is perhaps the fundamental theory of computer science. It sets out to define, mathematically, what exactly computation is, what is feasible to solve using a computer, and also what is not possible to solve using a computer. The main objective is to define a computer mathematically, without the reliance on real-world computers, hardware or software, or the plethora of programming languages we have in use today. The notion of a Turing machine serves this purpose and defines what we believe is the crux of all computable functions.
This channel is also about weaker forms of computation, concentrating on two classes: regular languages and context-free languages. These two models help understand what we can do with restricted means of computation, and offer a rich theory using which you can hone your mathematical skills in reasoning with simple machines and the languages they define.
However, they are not simply there as a weak form of computation--the most attractive aspect of them is that problems formulated on them are tractable, i.e. we can build efficient algorithms to reason with objects such as finite automata, context-free grammars and pushdown automata. For example, we can model a piece of hardware (a circuit) as a finite-state system and solve whether the circuit satisfies a property (like whether it performs addition of 16-bit registers correctly). We can model the syntax of a programming language using a grammar, and build algorithms that check if a string parses according to this grammar.
On the other hand, most problems that ask properties about Turing machines
are undecidable. This Youtube channel will help you see and prove that several tasks involving Turing machines are unsolvable---i.e., no computer, no software, can solve it. For example, you will see that there is no software that can check whether a
C program will halt on a particular input. To prove something is possible is, of course, challenging. But to show something is impossible is rare in computer
science, and very humbling.
4 سال پیش
در تاریخ 1399/03/12 منتشر شده
است.
19,655
بـار بازدید شده