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 MapItem 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 |
, Shelving location: Main Collection Close shelf browser
511.3 YE FU Fuzzy logic : | 511.313 BA FU Fuzzy logic-based material selection and synthesis | 511.313 ZA FU Fuzzy logic theory and applications : | 511.350285635 MI FI Finite-state techniques : | 511.352 AR CO Computational complexity : | 511.36 WA NO Non-axiomatic logic : a model of intelligent reasoning / | 511.4 KO AP Approximation techniques for engineers |
"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"--