Descriptive Set Theoretic Methods in Automata Theory:Decidability and Topological Complexity(Theoretical Computer Science and General Issues)

自动机理论的描述集理论方法:可判定性与拓扑复杂性

数理逻辑与数学基础

售   价:
727.00
发货周期:外国库房发货,通常付款后3-5周到货
出  版 社
出版时间
2016年08月06日
装      帧
平装
ISBN
9783662529461
复制
页      码
211
开      本
9.21 x 6.14 x 0.48
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology. ’…the thesis of Micha? Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个