Logic and automata : history and perspectives
Logic and automata : history and perspectives
复制标题
DOI：
10.5117/9789053565766
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
J. Flum;E. Grädel;T. Wilke
中科院分区：
文献类型：
--
作者：
J. Flum;E. Grädel;T. Wilke
目录[-] - 6[-]前言[-] - 8[-]1.关于树语言的拓扑复杂性[-] - 10[-]2. Nonederministic控制器的不确定preocesses - 30[-]3.连续时间马尔可夫奖励决策过程的可达性[-] - 54[-]4.逻辑理论与相容运算[-] - 74[-]5. [-] 108.第一次的约会自动机和半群识别无限的话- 134[-]7. [-]8.第170话：我的世界[-] 252[-] 2016年09月归档[-]10.第262话：我的世界基于矩阵的复杂性函数和可识别的图片语言[-] - 308[-]11.应用Blackwell最优性：优先平均支付游戏作为多折扣游戏的限制- 332[-]12.逻辑、图形和算法- 358[-]13。非正规定点逻辑与博弈-424 [-]14. [-]15.第458章：你是谁？确定性自上而下树自动机：过去，现在和未来- 506[-]16.一元逻辑对词的表达能力，树，图片和图形- 532[-]17. [-]18.第一次世界大战[-]19.第576章：我的天[-]20.第614章：你是谁[-]自动机：从逻辑到算法- 630
Table of Contents[-] - 6[-]Preface[-] - 8[-]1. On the topological complexity of tree languages[-] - 10[-]2. Nonederministic controllers of nondeterministic preocesses - 30[-]3. Reachability in continuous-time Markov reward decision processes[-] - 54[-]4. Logical theories and compatible operations[-] - 74[-]5.[-]Forest algebras - 108[-]6. Automata and semigroups recognizing infinite words - 134[-]7. Deterministic graph grammars - 170[-]8. Quantifier-free definable graph opreations preserving recognizability[-] - 252[-]9.[-]First-order definable languages - 262[-]10. Matrix-based complexity functions and recognizable picture languages[-] - 308[-]11. Apllying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games - 332[-]12. Logic, graphs and algorithms - 358[-]13. Non-regular fixed-points logics and games - 424[-]14. The universal automaton - 458[-]15. Deterministic top-down tree automata: past, present, and future - 506[-]16. Expressive power of monadic logics on words, trees, pictures and graphs - 532[-]17. Structured strategies in games on graphs - 554[-]18. Counting in trees - 576[-]19.[-]Modular quantifiers - 614[-]20.[-]Automata: from logics to algorithms - 630