O'Reilly logo

Formal Languages and Automata Theory by K.V.N. Sunitha

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

1

Mathematical Preliminaries and Formal Languages

Formal languages and automata theory are based on mathematical computations. These computations are used to represent various mathematical models.

In this chapter, we discuss the mathematical preliminaries that form the foundation of computation. We discuss mathematical basics such as set theory, relations and functions. The basics of graph theory, language and grammar are discussed. A description of different techniques to prove theorems are also explained here. We study many interesting models such as finite automata, pushdown automata, linear bound automata and Turing machine. The theory about these models is automata theory. We will also discuss formal languages. A formal language is a set ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required