
- 644 pages
- English
- PDF
- Available on iOS & Android
Theory of Formal Languages with Applications
About this book
Formal languages provide the theoretical underpinnings for the study of programming languages as well as the foundations for compiler design. They are important in such areas as the study of biological systems, data transmission and compression, computer networks, etc.
This book combines an algebraic approach with algorithmic aspects and decidability results and explores applications both within computer science and in fields where formal languages are finding new applications. It contains more than 600 graded exercises. While some are routine, many of the exercises are in reality supplementary material. Although the book has been designed as a text for graduate and upper-level undergraduate students, the comprehensive coverage of the subject makes it suitable as a reference for scientists.
Request Inspection Copy
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Contents
- Preface
- Introduction
- Part I Introductory Notions
- Part II Regular and Context-Free Languages
- Part III Algorithmic Aspects
- Part IV Applications
- Bibliography
- Notation Index
- Topic Index