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

Published: 25 September 2020
on channel: 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.

On this page of the site you can watch the video online What is a Regular Grammar? NFA to Regular Grammar conversion also! with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 25 September 2020, share the link with friends and acquaintances, this video has already been watched 11,110 times on youtube and it was liked by 317 viewers. Enjoy your viewing!

15,982

438