Screen LibraryFinite-state techniques : automata, transducers and bimachines /
"Preface Finite-state techniques provide theoretically elegant and computationally ef- cient solutions for various (hard, non-trivial) problems in text and natural language processing. Due to its importance in many fundamental applications, the theory of nite-state automata and related nite-sta...
Saved in:
| Main Authors: | |
|---|---|
| Group Author: | |
| Published: |
Cambridge University Press,
|
| Publisher Address: | Cambridge, United Kingdom : |
| Publication Dates: | 2019. |
| Literature type: | Book |
| Language: | English |
| Series: |
Cambridge tracts in theoretical computer science ;
60 |
| Subjects: | |
| Summary: |
"Preface Finite-state techniques provide theoretically elegant and computationally ef- cient solutions for various (hard, non-trivial) problems in text and natural language processing. Due to its importance in many fundamental applications, the theory of nite-state automata and related nite-state machines has been extensively studied and its development still continues. This textbook describes the basics of nite state technology, following a combined mathematical and implementational point of view. It is written for advanced undergraduate and graduate students in computer science, computatio |
| Carrier Form: | x, 304 pages : illustrations ; 24 cm. |
| Bibliography: | Includes bibliographical references (pages 298-301) and index. |
| ISBN: |
9781108485418 1108485413 |
| Index Number: | QA267 |
| CLC: | O233 |
| Call Number: | O233/M636 |
| Contents: | Part I. Formal background -- 1. Formal preliminaries -- 2. Monoidal finite-state automata -- 3. Classical finite-state automata and regular languages -- 4. Monoidal multi-type automata and finite-state transducers -- 5. Deterministic transducers -- 6. Biomachines -- 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 automation for a finite language -- 11. Constructing finite-state devices for text rewriting. |