Finite-state techniques : automata, transducers and bimachines /
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2019.
|
| Series: | Cambridge tracts in theoretical computer science ;
60. |
| Subjects: | |
| Online Access: | CONNECT |
| Summary: | Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice. |
|---|---|
| Item Description: | Title from publisher's bibliographic system (viewed on 29 Jul 2019). |
| Physical Description: | 1 online resource (x, 304 pages) : digital, PDF file(s). |
| ISBN: | 9781108756945 (ebook) |
