Testing Set Membership and Equality of Regular Languages (Theory of Computing)
In today's lecture, we learn how to test if a string belongs to a language and also how to test if two regular languages are equal (which translates into a test for testing if an automaton/regex describe a language how to test if the two described languages are the same).
Time Stamps:
0:00 Recap and opening
0:45 Testing set membership of a string in a language or not.
5:26 Testing equality of two regular languages
17:33 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: / pagewizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: / danielrpage
TWITTER: / pagewizardgle
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: / pagewizard
#ComputerScience
#theoryofcomputation
#automata