Algorithmic Combinatorics on Partial Words(Discrete Mathematics and Its Applications)

不完整字的算法组合

数学史

售   价:
1862.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2007年11月19日
装      帧
精装
ISBN
9781420060928
复制
页      码
392
开      本
6-1/8x9-1/4
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book presents a mathematical treatment of combinatorics on partial words designed around algorithms and explores up-and-coming techniques for solving partial word problems as well as the future direction of research. It provides algorithms in English followed by pseudo code to facilitate implementation of the algorithms and includes numerous worked examples, diagrams, exercises, selected solutions, and links to web interfaces that have been established for automated use of the programs related to the book. The author covers the topics of periodicity, primitivity, pcodes, binary and ternary correlations, and unavoidable sets of partial words.
馆藏图书馆
Yale University Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个