{"product_id":"finite-state-techniques-automata-transducers-and-bimachines-hardback-9781108485418","title":"Finite-State Techniques; Automata, Transducers and Bimachines (Hardback) 9781108485418","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eFinite-State Techniques\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eAutomata, Transducers and Bimachines\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eCovers the whole spectrum of finite-state methods, from theory to practical applications.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eStoyan Mihov (Author), Klaus U. Schulz (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781108485418, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 1 August 2019\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e314 pages, 46 b\/w illus.  3 tables  45 exercises\u003cbr\u003e23.4 x 15.8 x 2.1 cm, 0.57 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'… 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\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eFinite-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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePart I. Formal Background: 1. Formal preliminaries\u003cbr\u003e 2. Monoidal finite-state automata\u003cbr\u003e 3. Classical finite-state automata and regular languages\u003cbr\u003e 4. Monoidal multi-tape automata and finite-state transducers\u003cbr\u003e 5. Deterministic transducers\u003cbr\u003e 6. Bimachines\u003cbr\u003e Part II. From Theory to Practice: 7. The C(M) language\u003cbr\u003e 8. C(M) implementation of finite-state devices\u003cbr\u003e 9. The Aho–Corasick algorithm\u003cbr\u003e 10. The minimal deterministic finite-state automaton for a finite language\u003cbr\u003e 11. Constructing finite-state devices for text rewriting\u003cbr\u003e Bibliography\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Natural language \u0026amp; machine translation [\u003ca title=\"See our other books on Natural language \u0026amp; machine translation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Natural%20language%20\u0026amp;%20machine%20translation%20%5BUYQL%5D%22\"\u003eUYQL\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Programming \u0026amp; scripting languages: general [\u003ca title=\"See our other books on Programming \u0026amp; scripting languages: general\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Programming%20\u0026amp;%20scripting%20languages:%20general%20%5BUMX%5D%22\"\u003eUMX\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46005118894360,"sku":"9781108485418","price":56.45,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9781108485418i.jpg?v=1696706291","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/finite-state-techniques-automata-transducers-and-bimachines-hardback-9781108485418","provider":"Freshly Printed Books","version":"1.0","type":"link"}