Preface
Introduction to Formal Languages, Automata Theory and Computation presents the basic concepts of formal languages, automata, and computability theory to the students, with methods to solve problems in these topics.
Formal languages and automata theory emerged in the 1950s, when Noam Chomsky gave mathematical definitions of grammars for formal languages. One of his definitions coincided with the definition of the Backus Naur Form (BNF), used for the ALGOL 60 compiler. At about the same time, the concept of finite state automaton was introduced. While studying the application of compilers, the pushdown automaton was also defined and studied.
The theory of computation started with A. M. Turing’s paper on computability in 1936. He defined a ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access