This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
The theory of formal languages is widely recognized as the backbone of theoretical computer science, originating from mathematics and generative linguistics, among others. As a foundational discipline, formal language theory concepts and techniques are present in a variety of theoretical and applied fields of contemporary research which are concerned with symbol manipulation: discrete mathematics, bioinformatics, natural language processing, pattern recognition, text retrieval, learning, cryptography, compression, etc. This volume presents the main results of some recent, quickly developing subfields of formal language theory in an easily accessible way and provides the reader with extensive bibliographical references to go deeper. Open problems are formulated too. The intended audience consists of undergraduates and graduates in computer science or mathematics. Graduates in other disciplines (linguistics, electrical engineering, molecular biology, logic) with some basic level of mathematical maturity may find the volume appealing and useful too. The book represents ‘a gate to formal language theory and its applications’ and a source of information in computation theory in general. This volume is complementary of the volumes in the Springer series Studies in Fuzziness and Soft Computing, number 148, and Studies in Computational Intelligence, 25.
