Finite-State Techniques:Automata, Transducers and Bimachines(Cambridge Tracts in Theoretical Computer Science)

有限状态技术:自动装置、传感器与双机械

人工智能

售   价:
666.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2019年01月08日
装      帧
精装
ISBN
9781108485418
复制
页      码
324
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个