Description
Finite-State Techniques: Automata, Transducers and Bimachines is a definitive exploration of finite-state methods in theoretical computer science. This Cambridge tract presents a systematic treatment of automata theory, transducers, and bimachines, which are fundamental tools for processing formal languages and symbolic sequences.
The book bridges classical automata theory with modern computational applications, covering deterministic and non-deterministic finite automata, regular expressions, and transducers for string transformation. Bimachines, a powerful extension combining two transducers, are examined in depth for their applications in natural language processing and computational linguistics.
Authored by experts Stoyan Mihov and Klaus U. Schulz, this volume is essential for researchers and advanced students in theoretical computer science, formal language theory, and computational linguistics. The rigorous mathematical treatment, combined with practical insights, makes it invaluable for understanding the theoretical foundations underlying modern NLP systems and compiler design.
Reviews
There are no reviews yet.