Semirings, Automata, Languages(Monographs in Theoretical Computer Science. An EATCS Series)

数理逻辑与数学基础

原   价:
1668.00
售   价:
1334.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
2011年11月18日
装      帧
平装
ISBN
9783642699610
复制
页      码
376
开      本
9.61 x 6.69 x 0.80
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of ’reasonably important’ results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series (’AFP theory’). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个