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 ...
Get Introduction to Formal Languages, Automata Theory and Computation 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.
