株式会社極東書店トップ ＞ 商品一覧 ＞ Finite-State Techniques : Automata, Transducers and Bimachines.
商品詳細
Finite-State Techniques : Automata, Transducers and Bimachines.
・ISBN 978-1-108-48541-8 hard GB£ 74.00
￥23,443.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-108-75694-5
| 著者・編者 | Mihov, Stoyan / Schulz, Klaus U., |
|---|---|
| シリーズ | Cambridge Tracts in Theoretical Computer Science |
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 2019 |
| ページ数 | 314 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-15985＞ |
解説
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.