What is a Regular Grammar? NFA to Regular Grammar conversion also!

Veröffentlicht am: 25 September 2020
auf dem Kanal: Easy Theory
11,110
317

Here we look at "regular grammars", which are a type of grammar where the rules are heavily restricted. Only four types of rules are allowed. We also show how to convert from any NFA into an equivalent regular grammar, and vice versa. Both proofs are similar because the first one is a "1 to 1" conversion, meaning that "nothing is lost" during it, and so therefore can be reversed.

Donation (appears on streams): https://streamlabs.com/easytheory1/tip
Paypal: https://paypal.me/easytheory
Patreon:   / easytheory  
Discord:   / discord  

Timestamps:
0:00 - Intro
0:40 - What is a regular grammar?
4:00 - Regular Grammar to NFA conversion
13:30 - DFA/NFA to Regular Grammar conversion

Youtube Live Streaming (Sundays) - subscribe for when these occur.

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  

Gold Supporters: Micah Wood
Silver Supporters: Timmy Gy

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶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.


Auf dieser Seite können Sie das Online-Video What is a Regular Grammar? NFA to Regular Grammar conversion also! mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer Easy Theory 25 September 2020 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 11,110 Mal angesehen und es wurde von 317 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!