Librarium
Settings

What is a Regular Language? - Easy Theory

Easy Theory
dfa regular expressiondfa regular languageeasy theoryeasy theory dfaeasy theory regulareasy theory regular languagefinite languagefinite regularinfinite languageinfinite regular languageregular languageregular language exampleregular language in theory of computationregular language to dfaregular languagestheory of computationwhat is a regular expressionwhat is a regular language

Here we define what a regular language is, in that it corresponds to a DFA (deterministic finite automaton). All that is needed is for the DFA to exist, and not necessarily to give the DFA precisely. We also give some examples of regular languages that we have seen before.

Contribute: Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶ADDITIONAL QUESTIONS◀

  1. Give an infinite regular language that is not Sigma*.
  2. What can we say about L if L is a finite language?

▶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 over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory. ... https://www.youtube.com/watch?v=xTIddipVd2M

2021-10-08
0.0 LBC
Copyrighted (contact publisher)

36930292 Bytes