Scribd
Upload
5 views47 pages

Module 2 Part 1

This module discusses regular languages, regular grammars, and their properties, highlighting two methods for describing regular languages: regular expressions and regular grammars. It emphasizes the equivalence of these methods and the ability to convert between them, allowing for flexibility in representation. The chapter aims to provide a foundational understanding of these concepts in formal languages and automata theory.

Uploaded by

Vinay Negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views47 pages

Module 2 Part 1

This module discusses regular languages, regular grammars, and their properties, highlighting two methods for describing regular languages: regular expressions and regular grammars. It emphasizes the equivalence of these methods and the ability to convert between them, allowing for flexibility in representation. The chapter aims to provide a foundational understanding of these concepts in formal languages and automata theory.

Uploaded by

Vinay Negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 47

Formal languages and Automata

Theory (FLAT)
MODULE 2

REGULAR LANGUAGES, REGULAR GRAMMARS


AND PROPERTIES OF REGULAR LANGUAGES:
• two alternative methods for describing regular languages: regular
expressions and regular grammars.
• Regular expressions, whose form is reminiscent of the familiar
arithmetic expressions, are convenient in some applications because
of their simple string form, but they are
• restricted and have no obvious extension to the more complicated
languages we will encounter later.
• Regular grammars, on the other hand, are just a special case of many
different types of grammars.
• The purpose of this chapter is to explore the essential equivalence of
these three modes of describing regular languages. The
constructions that make conversion from one form to another are in
the theorems in this chapter.
• Since each representation of a regular language is fully convertible to
any of the others, we can choose whichever is most convenient for
the situation at hand.
Generalized Transition Graph (GTG)
REFERENCES
1. Peter Linz, An Introduction to Formal Languages and Automat,
(6e), Jones & Bartlett Learning, 2016

You might also like