Abstract
This chapter aims to cover regular languages and regular grammars. Regular languages belong to the class of languages accepted by finite automata. This chapter begins with language hierarchy introducing different forms of languages in automata theory. Further, the chapter covers the concept of regular expressions, their formation and properties. The chapter also describes the methods of conversion of regular expressions to finite automata and vice versa as well as important closure properties of regular languages and pumping lemma. The concept of regular grammar is stated ahead in this chapter. It covers right linear grammars, left linear grammars, design of regular grammars, and interconversion among right and left linear grammars.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
