GRAPH STRUCTRE AND MONADIC SECOND-ORDER LOGIC A LANGUAGE-THEORETIC APPROACHpdf电子书版本下载

点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快] 温馨提示：（请使用BT下载软件FDM进行下载）软件下载地址页 直链下载[便捷但速度慢]   [在线试读本书]   [在线获取解压码]

GRAPH STRUCTRE AND MONADIC SECOND-ORDER LOGIC A LANGUAGE-THEORETIC APPROACHPDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如 BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！

（文件页数 要大于 标注页数，上中下等多册电子书除外）

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

Introduction 1

1 Overview 16

1.1 Context-free grammars 17

1.2 Inductive sets of properties and recognizability 28

1.3 Monadic second-order logic 40

1.4 Two graph algebras 46

1.5 Fixed-parameter tractability 53

1.6 Decidability of monadic second-order logic 56

1.7 Graph transductions 58

1.8 Monadic second-order logic with edge set quantifications 68

1.9 Relational structures 74

1.10 References 78

2 Graph algebras and widths of graphs 80

2.1 Algebras and terms 81

2.2 Graphs 87

2.3 The HR algebra of graphs with sources 99

2.4 Tree-decompositions 121

2.5 The VR algebra of simple graphs with ports 144

2.6 Many-sorted graph algebras 176

2.7 References 185

3 Equational and recognizable sets in many-sorted algebras 188

3.1 The equational sets of an algebra 189

3.2 Transformations of equation systems 206

3.3 Intermezzo on automata 221

3.4 The recognizable sets of an algebra 227

3.5 References 259

4 Equational and recognizable sets of graphs 260

4.1 HR-equational sets of graphs 261

4.2 HR-recognizable sets of graphs 281

4.3 VR-equational sets of simple graphs 292

4.4 VR-recognizable sets of simple graphs 305

4.5 HR- and VR-equational and recognizable sets 312

4.6 References 313

5 Monadic second-order logic 315

5.1 Relational structures and logical languages 315

5.2 Graph properties expressible in monadic second-order logic 331

5.3 Monadic second-order logic and recognizability 358

5.4 Decidable monadic second-order theories 408

5.5 Logical characterization of recognizability 409

5.6 Equivalences of logical formulas 416

5.7 References 425

6 Algorithmic applications 427

6.1 Fixed-parameter tractable algorithms for model-checking 428

6.2 Decomposition and parsing algorithms 433

6.3 Monadic second-order formulas compiled into fiinite automata 439

6.4 Other monadic second-order problems solved with automata 493

6.5 References 503

7 Monadic second-order transductions 505

7.1 Defiinitions and basic properties 506

7.2 The Equationality Theorem for the VR algebra 534

7.3 Graph transductions using incidence graphs 555

7.4 The Equationality Theorem for the HR algebra 559

7.5 Decidability of monadic second-order satisfiiability problems 566

7.6 Questions about logical characterizations of recognizability 574

7.7 References 576

8 Transductions of terms and words 578

8.1 Terminology 580

8.2 Tree-walking transducers 585

8.3 The basic characterization 591

8.4 From jumping to walking 593

8.5 From global to local tests 595

8.6 Multi bottom-up tree-to-word transducers 604

8.7 Attribute grammars and macro tree transducers 610

8.8 Nondeterminism 613

8.9 VR-equational sets of terms and words 614

8.10 References 618

9 Relational structures 621

9.1 Two types of ternary relational structures related to ordered sets 622

9.2 Relational structures of bounded tree-width 629

9.3 Terms denoting relational structures 636

9.4 Sparse relational structures 651

9.5 References 685

Conclusion and open problems 686

References 691

Index of notation 711

Index 721