Understanding Grammars in the Theory of Computation 📚
Learn what grammars are and how they formally generate strings in the theory of computation. Discover how they differ from automata like DFA and NFA in recognizing languages.
Easy Theory
20.3K views • Sep 25, 2020
About this video
Here we look at a "grammar", which is a way of formally generating strings. We saw with DFA/NFAs that they can recognize whether a string is in the language, and a regular expression describes a language. The grammar has a set of rules that one can apply from the "start variable", to hopefully get a string entirely of terminals.
Easy Theory Website: https://www.easytheory.org
GoFundMe: https://www.gofundme.com/f/easy-theory-video-studio
Patreon: https://www.patreon.com/EasyTheoryYT
Fourthwall: https://easy-theory-llc-shop.fourthwall.com
Problem Solving channel: @easytheoryprobsolve
If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1
Easy Theory Website: https://www.easytheory.org
GoFundMe: https://www.gofundme.com/f/easy-theory-video-studio
Patreon: https://www.patreon.com/EasyTheoryYT
Fourthwall: https://easy-theory-llc-shop.fourthwall.com
Problem Solving channel: @easytheoryprobsolve
If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
20.3K
Likes
692
Duration
12:49
Published
Sep 25, 2020
User Reviews
4.6
(4) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now