Umfang:
x, 304 Seiten
,
Diagramme
ISBN:
9781108485418
,
1108485413
Serie:
Cambridge tracts in theoretical computer science 60
Inhalt:
"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, computational linguistics and mathematics. Though concepts are introduced in a mathematically rigorous way and correctness proofs for all procedures are given, the book is not meant as a purely theoretical introduction to the subject. The ultimate goal is to bring students to a position where they can both understand and implement complex nite-state based procedures for practically relevant tasks"--
Anmerkung:
Literaturverzeichnis: Seite 298-301
Weitere Ausg.:
Erscheint auch als Online-Ausgabe Mihov, Stoyan, 1968 - Finite-state techniques Cambridge : Cambridge University Press, 2019 ISBN 9781108756945
Sprache:
Englisch
Fachgebiete:
Informatik
Schlagwort(e):
Transduktor
;
Komplexitätstheorie
;
Automatentheorie
DOI:
10.1017/9781108756945
