Finite-State Techniques - Automata, Transducers and Bimachines

Covers the whole spectrum of finite-state methods, from theory to practical applications.

Table des matières

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; Bibliography; Index.

A propos de l'auteur

Stoyan Mihov is Associate Professor at the Bulgarian Academy of Sciences (IICT) 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 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.

Résumé

This text for graduate students and researchers gives a complete coverage of the field with mathematical rigour, from basics to advanced topics. It closes the gap between theory and real practice by providing full proofs and executable code for all algorithms, showcasing the efficient and elegant solutions that finite-state methods offer.

Détails du produit

• Auteurs: Stoyan Mihov, Stoyan Schulz Mihov, Klaus U. Schulz, Klaus U. (Ludwig-Maximilians-Universitat Munchen) Schulz, Schulz Klaus U.
• Edition: Cambridge University Press ELT
• Langues: Anglais
• Format d'édition: Livre Relié
• Sortie: 30.09.2019
• EAN: 9781108485418
• ISBN: 978-1-108-48541-8
• Pages: 314
• Thèmes: Cambridge Tracts in Theoretical Computer Science; Cambridge Tracts in Theoretica
• Catégories: Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Langages de programmation; Artificial Intelligence, Artificial Intelligence (AI), Mathematical theory of computation, Mathematical logic, COMPUTERS / Languages / General