3
Regular Languages and Regular Grammars
- Regular Expressions are shorthand notations to describe a language. They are used in many programming languages and Language tools such as lex, vi editor, PHP and PERL. They are used as powerful tool in search engines.
In this chapter we introduce Regular Expression (RE), Regular Sets and representation of regular sets using regular expressions. Operations on regular expressions along with identity rules are described. Equivalence of Finite Automata (FA) and regular expressions & equivalence of Regular expressions and finite automata are explained. Interconversion between regular expression to NFA and DFA to Regular expression using recursive procedure, Arden’s theorem and generalized non-deterministic ...
Get Formal Languages and Automata Theory 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.
