Regular Grammar|Theory of Automata and Formal Language|GATE2022|UGCNET2024|WBSET2024

Type-3 grammar/regular grammar: Regular grammar generates regular language. They have a single non-terminal on the left-hand side and a right-hand side consisting of a single terminal or single terminal followed by a non-terminal. The regular languages can be generated by regular grammar. In regular grammar, the left-hand side always consists of a single non-terminal. The left side cannot have more than one non-terminal or any terminal variable. There can be a single terminal or a single terminal followed by a non-terminal on the right-hand side. The lecture aims to explain a very simple form of grammar. The NFA design and minimization has been given in another video lecture whose video link is : https://www.youtube.com/watch?v=MDDEO8wVuGA&t=1s https://www.youtube.com/watch?v=8t307jRmwqU&t=665s