Finite-State Techniques: Automata, Transducers and Bimachines
Stoyan Mihov, Klaus U. Schulz
Finite-state techniques provide theoretically elegant and computationally effi-
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 finite-state automata and related finite-state machines has been
extensively studied and its development still continues.
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 finite-state automata and related finite-state machines has been
extensively studied and its development still continues.
Kategorien:
Jahr:
2019
Verlag:
Cambridge University Press
Sprache:
english
Seiten:
315
ISBN 10:
1108756948
ISBN 13:
9781108756945
Serien:
Cambridge Tracts in Theoretical Computer Science 60
Datei:
PDF, 3.56 MB
IPFS:
,
english, 2019