What is a Regular Grammar? NFA to Regular Grammar conversion also!
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: https://www.patreon.com/easytheory
Discord: https://discord.gg/SD4U3hs
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-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
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.
Видео What is a Regular Grammar? NFA to Regular Grammar conversion also! канала Easy Theory
Donation (appears on streams): https://streamlabs.com/easytheory1/tip
Paypal: https://paypal.me/easytheory
Patreon: https://www.patreon.com/easytheory
Discord: https://discord.gg/SD4U3hs
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-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
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.
Видео What is a Regular Grammar? NFA to Regular Grammar conversion also! канала Easy Theory
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![Context-Free Grammars (CFG) and Context-Free Languages (CFL) - what are they?](https://i.ytimg.com/vi/h1OSmLSacNA/default.jpg)
![A Double Conversion: Regular Grammar to NFA to Regex!](https://i.ytimg.com/vi/6SyRwpyQF6I/default.jpg)
![REGULAR GRAMMAR IN AUTOMATA THEORY || GRAMMAR || LEFT LINEAR GRAMMAR || RIGHT LINEAR GRAMMAR || TOC](https://i.ytimg.com/vi/_H0TeJek3GI/default.jpg)
![Regular Grammar](https://i.ytimg.com/vi/WgEsPTAL55Q/default.jpg)
![Regular Grammars (Brief Intro to Formal Language Theory 4)](https://i.ytimg.com/vi/RiOMwbtwor8/default.jpg)
![Pumping Lemma for Context-Free Languages, Statement and FULL PROOF](https://i.ytimg.com/vi/-UH9L2sJpPQ/default.jpg)
![Conversion of NFA to Regex Example #2 (GNFA Method)](https://i.ytimg.com/vi/Gfa3WUFVsJA/default.jpg)
![Regular Languages Closed Under Subsequences](https://i.ytimg.com/vi/2bPMta_92tI/default.jpg)
![Theory Computer Science Professors Be Like](https://i.ytimg.com/vi/jYgyTvvcM6c/default.jpg)
![Theory of Computation | Introduction to Grammars and generating Language from Grammar](https://i.ytimg.com/vi/Tp0b3aN6iKE/default.jpg)
![2.2: Regular Expressions: Meta-characters - Programming with Text](https://i.ytimg.com/vi/YTocEnDsMNw/default.jpg)
![Deterministic Context-Free Languages (DCFLs), what are they?](https://i.ytimg.com/vi/GzR5FiiIogY/default.jpg)
![context free grammar in automata |Example-1 | TOC | Lec-49 | Bhanu Priya](https://i.ytimg.com/vi/nyjB5xW0tQc/default.jpg)
![How I Published a Paper in Theoretical Computer Science](https://i.ytimg.com/vi/2j2Tac6Khdo/default.jpg)
![Pushdown Automaton to Context-Free Grammar Conversion (PDA to CFG)](https://i.ytimg.com/vi/X0nrYIVGs3M/default.jpg)
![What is an Nondeterministic Finite Automaton, and why do we care?](https://i.ytimg.com/vi/P5iWwYtwlwg/default.jpg)
![Conversion of NFA to DFA Examples (Powerset Construction)](https://i.ytimg.com/vi/oCRbwLXvNjI/default.jpg)
![What is Theoretical Computer Science?](https://i.ytimg.com/vi/7GWP0oP4_Vc/default.jpg)
![Pumping Lemma for Context Free Languages](https://i.ytimg.com/vi/k2zmkGHwhxs/default.jpg)
![Lec-5: What is Grammar in TOC | Must Watch](https://i.ytimg.com/vi/5Jd54dxQ1_Q/default.jpg)