Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Bøger
Bestsellers
Kommer snart
Nyheder
Spil og hobby
Kurv
  1. Bog
  2. Matematikkens fundament
  3. Matematisk logik

Finite-State Techniques

- Automata, Transducers and Bimachines
Af: Klaus U. Schulz, Stoyan Mihov Engelsk Hardback

Finite-State Techniques

- Automata, Transducers and Bimachines
Af: Klaus U. Schulz, Stoyan Mihov Engelsk Hardback
Tjek vores konkurrenters priser
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as ''input-output'' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.
Vis mere
Tjek vores konkurrenters priser
Normalpris
kr 688
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as ''input-output'' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.
Vis mere
Se mere i:
Produktdetaljer
Sprog: Engelsk
Sider: 314
ISBN-13: 9781108485418
Indbinding: Hardback
Udgave:
ISBN-10: 1108485413
Kategori: Matematisk logik
Udg. Dato: 1 aug 2019
Længde: 23mm
Bredde: 233mm
Højde: 159mm
Forlag: Cambridge University Press
Oplagsdato: 1 aug 2019
Forfatter(e): Klaus U. Schulz, Stoyan Mihov
Forfatter(e) Klaus U. Schulz, Stoyan Mihov

Kategori Matematisk logik

ISBN-13 9781108485418

Sprog Engelsk

Indbinding Hardback

Sider 314

Udgave

Længde 23mm

Bredde 233mm

Højde 159mm

Udg. Dato 1 aug 2019

Oplagsdato 1 aug 2019

Forlag Cambridge University Press