Normal view MARC view ISBD view

Finite-state techniques : automata, transducers and bimachines

By: Mihov, Stoyan
Title By: Schulz, Klaus U
Material type: BookSeries: Cambridge tracts in theoretical computer science ; 60.Publisher: New York, NY : Cambridge University Press, 2019.Description: x, 304 p. ; 24 cm.ISBN: 9781108485418Subject(s): Sequential machine theoryDDC classification: 511.350285635 MI FI Online resources: Location Map
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, 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"--
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Home library Call number Status Notes Date due Barcode Item holds
REGULAR University of Wollongong in Dubai
Main Collection
511.350285635 MI FI (Browse shelf) Available Jan2020 T0063438
Total holds: 0

"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"--

Powered by Koha