Monadic second order logic and node relations on graphs and trees

被引：0

作者：

Bloem, R ^{[1
]}

Engelfriet, J ^{[1
]}

机构：

[1] Leiden Univ, Dept Comp Sci, NL-2300 RA Leiden, Netherlands

来源：

STRUCTURES IN LOGIC AND COMPUTER SCIENCE | 1997年 / 1261卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A formula from monadic second-order (MSO) logic can be used to specify a binary relation on the set of nodes of a tree. It is proved that, equivalently, such a relation can be computed by a finite-state tree-walking automaton, provided the automaton can test MSO properties of the nodes of the tree. For graphs, if a binary relation on the nodes of a graph can be computed by a finite-state graph-walking automaton, then it can be specified by an Mao formula. but, in general, not vice versa.

引用

页码：144 / 161

页数：18

共 50 条

[31] The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Courcelle, B
THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 1 - 36
[32] Weighted Automata and Monadic Second Order Logic
Labai, Nadia
Makowsky, Johann A.
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (119): : 122 - 135
[33] Measure Quantifier in Monadic Second Order Logic
Michalewski, Henryk
Mio, Matteo
LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016), 2016, 9537 : 267 - 282
[34] Monadic second-order logic and the domino problem on self-similar graphs
Bartholdi, Laurent
GROUPS GEOMETRY AND DYNAMICS, 2022, 16 (04) : 1423 - 1459
[35] Monadic second-order logic of graphs XIII: Graph drawings with edge crossings
Courcelle, B
THEORETICAL COMPUTER SCIENCE, 2000, 244 (1-2) : 63 - 94
[36] Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false
Popova, S. N.
Zhukovskii, M. E.
ANNALS OF PURE AND APPLIED LOGIC, 2019, 170 (04) : 505 - 514
[37] Asymptotic Monadic Second-Order Logic
Blumensath, Achim
Carton, Olivier
Colcombet, Thomas
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 87 - +
[38] Monadic second order logic as the model companion of temporal logic
Ghilardi, Silvio
van Gool, Sam
PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 417 - 426
[39] The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
Courcelle, Bruno
Delhomme, Christian
THEORETICAL COMPUTER SCIENCE, 2008, 394 (1-2) : 1 - 38
[40] Enumeration of Monadic Second-Order Queries on Trees
Kazana, Wojciech
Segoufin, Luc
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2013, 14 (04)

← 1 2 3 4 5 →