Skip to content
Register Sign in Wishlist
Look Inside Finite-State Techniques

Finite-State Techniques
Automata, Transducers and Bimachines

AUD$109.95 inc GST

Part of Cambridge Tracts in Theoretical Computer Science

  • Publication planned for: October 2019
  • availability: Not yet published - available from October 2019
  • format: Hardback
  • isbn: 9781108485418

AUD$ 109.95 inc GST

Pre-order Add to wishlist

Looking for an inspection copy?

Please email to enquire about an inspection copy of this book

Product filter button
About the Authors
  • 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.

    • Goes beyond 'read-only' devices to cover the transformational devices that are of central interest in the field
    • End-of-chapter exercises enable readers to implement complex finite-state based procedures for interesting tasks
    • Provides executable source code in the new C(M) language, designed to focus on the high-level mathematical steps of a construction
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Publication planned for: October 2019
    • format: Hardback
    • isbn: 9781108485418
    • dimensions: 234 x 158 x 21 mm
    • weight: 0.57kg
    • contains: 46 b/w illus. 3 tables 45 exercises
    • availability: Not yet published - available from October 2019
  • Table of Contents

    Part I. Formal Background:
    1. Formal preliminaries
    2. Monoidal finite-state automata
    3. Classical finite-state automata and regular languages
    4. Monoidal multi-tape automata and finite-state transducers
    5. Deterministic transducers
    6. Bimachines
    Part II. From Theory to Practice:
    7. The C(M) language
    8. C(M) implementation of finite-state devices
    9. The Aho–Corasick algorithm
    10. The minimal deterministic finite-state automaton for a finite language
    11. Constructing finite-state devices for text rewriting

  • Authors

    Stoyan Mihov, Bulgarian Academy of Sciences
    Stoyan Mihov is Associate Professor at the Bulgarian Academy of Sciences and a lecturer at Sofia University. He has published several efficient automata constructions and approximate search methods, which are widely used for natural language processing and information retrieval. Dr Mihov has led the development of multiple award-winning systems for language and speech processing.

    Klaus U. Schulz, Ludwig-Maximilians-Universität Munchen
    Klaus U. Schulz is Professor of Information and Language Processing at the Ludwig-Maximilians-Universität Munchen. He has published over 100 articles in distinct fields of computer science, with contributions in approximate search and transducer technology. He was head of many projects in text-correction and digital humanities, on both a national and European level.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.