Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (Lecture Notes in Computer Science)
暫譯: 自描述集合論方法在自動機理論中的應用:可判定性與拓撲複雜性(計算機科學講義)

Michal Skrzypczak

  • 出版商: Springer
  • 出版日期: 2016-08-06
  • 售價: $2,410
  • 貴賓價: 9.5$2,290
  • 語言: 英文
  • 頁數: 228
  • 裝訂: Paperback
  • ISBN: 3662529467
  • ISBN-13: 9783662529461
  • 相關分類: Computer-Science
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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.


商品描述(中文翻譯)

這本書基於博士論文《自動機理論中的描述性集合理論方法》,該論文於2015年獲得E.W. Beth獎,以表彰在邏輯、語言和信息領域的傑出論文。該論文揭示了邏輯、高級描述性集合理論、拓撲學和自動機理論之間意想不到的聯繫,並提供了這些領域之間相互作用的深刻見解。它為無限字串和樹的自動機理論中的核心問題開啟了新的視角,並從拓撲學的角度提供了該理論的非常顯著的進展。

「……Michał Skrzypczak的論文無疑提供了我們對優秀數學的期望:在先前不同的概念之間建立新的意想不到的聯繫,以及涉及啟發性思想的證明。」— Thomas Colcombet。