Here we give different proofs that EQ_DFA is decidable: (1) a different formulation of "equality" for two sets (namely regular languages), (2) minimization of DFAs, and (3) using the pumping lemma.
Easy Theory Website: www.easytheory...
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com...
Paypal: paypal.me/easy...
Patreon: / easytheory
Discord: / discord
KZitem Live Streaming (Sundays) - subscribe for when these occur.
Merch:
Language Hierarchy Apparel: teespring.com/...
Pumping Lemma Apparel: teespring.com/...
If you like this content, please consider subscribing to my channel: / @easytheory
Gold Supporters: Micah Wood
Silver Supporters: Timmy Gy
▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
Негізгі бет Equivalence for DFAs is Decidable (3 different proofs!)
Пікірлер: 8