3: Regular expressions, regular language and grammar
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 ...
Get Automata Theory and Formal Languages now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
