Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
86,10 €*
Versandkostenfrei per Post / DHL
Aktuell nicht verfügbar
Kategorien:
Beschreibung
Covers the whole spectrum of finite-state methods, from theory to practical applications.
Covers the whole spectrum of finite-state methods, from theory to practical applications.
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Programmiersprachen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Buch |
ISBN-13: | 9781108485418 |
ISBN-10: | 1108485413 |
Sprache: | Englisch |
Ausstattung / Beilage: | HC gerader Rücken kaschiert |
Einband: | Gebunden |
Autor: |
Mihov, Stoyan
Schulz, Klaus U. |
Hersteller: | Cambridge University Press |
Verantwortliche Person für die EU: | Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de |
Maße: | 235 x 157 x 23 mm |
Von/Mit: | Stoyan Mihov (u. a.) |
Erscheinungsdatum: | 08.01.2019 |
Gewicht: | 0,666 kg |
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Programmiersprachen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Buch |
ISBN-13: | 9781108485418 |
ISBN-10: | 1108485413 |
Sprache: | Englisch |
Ausstattung / Beilage: | HC gerader Rücken kaschiert |
Einband: | Gebunden |
Autor: |
Mihov, Stoyan
Schulz, Klaus U. |
Hersteller: | Cambridge University Press |
Verantwortliche Person für die EU: | Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de |
Maße: | 235 x 157 x 23 mm |
Von/Mit: | Stoyan Mihov (u. a.) |
Erscheinungsdatum: | 08.01.2019 |
Gewicht: | 0,666 kg |
Sicherheitshinweis