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.
Inhaltsangabe
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 AhöCorasick algorithm 10. The minimal deterministic finite-state automaton for a finite language 11. Constructing finite-state devices for text rewriting Bibliography Index.
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 AhöCorasick algorithm 10. The minimal deterministic finite-state automaton for a finite language 11. Constructing finite-state devices for text rewriting Bibliography Index.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309