Finite-State Techniques

Automata, Transducers and Bimachines

By: Stoyan Mihov, Klaus U. Schulz

Write A Review

Hardcover | 1 August 2019

At a Glance

Hardcover
316 Pages

Dimensions(cm)
15.9 x 23.3 x 2.3

Hardcover

RRP $139.95

$126.75

or 4 interest-free payments of $31.69 with

Ships in 15 to 25 business days

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.

Industry Reviews

'... this volume is well written and very detailed. It is thus a nice reference for those results for the interested graduate or researcher ...' Andreas Maletti, ZB Math Reviews

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.