Publisher's Synopsis
The theory of formal languages and automata is one of the important and fundamental areas of theoretical computer science. While formal grammars are generating families of languages, automata are seen as recognition devices. The main focus of the subject of this proposed book is on normal forms, closure properties, characterisations and decidability results. In order to make the readers appreciate the use of the subject in other fields, we exhibit some applications in many areas such as Grammatical Inference, Pattern Matching and Cryptography. This book is intended for Computer Science, Engineering, and Mathematics disciplines.
