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 条

[1] Circle graphs and monadic second-order logic
LaBRI, Université Bordeaux 1, CNRS, 351 Cours de la libération, 33405 Talence Cedex, France
Journal of Applied Logic, 2008, 6 (03) : 416 - 442
[2] Quantifying over Trees in Monadic Second-Order Logic
Benerecetti, Massimo
Bozzelli, Laura
Mogavero, Fabio
Peron, Adriano
2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS, 2023,
[3] Existential monadic second order logic on random rooted trees
Holroyd, Alexander E.
Levy, Avi
Podder, Moumanti
Spencer, Joel
DISCRETE MATHEMATICS, 2019, 342 (01) : 152 - 167
[4] Monadic second order logic on graphs with local cardinality constraints
Szeider, Stefan
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 601 - 612
[5] Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Szeider, Stefan
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (02)
[6] THE MONADIC SECOND-ORDER LOGIC OF GRAPHS .8. ORIENTATIONS
COURCELLE, B
ANNALS OF PURE AND APPLIED LOGIC, 1995, 72 (02) : 103 - 143
[7] A hierarchical approach to monadic second-order logic over graphs
Schiering, I
COMPUTER SCIENCE LOGIC, 1998, 1414 : 424 - 440
[8] Regular subgraphs in graphs and rooted graphs and definability in monadic second-order logic
Stewart, IA
MATHEMATICAL LOGIC QUARTERLY, 1997, 43 (01) : 1 - 21
[9] The monadic second-order logic of graphs XII: planar graphs and planar maps
Courcelle, B
THEORETICAL COMPUTER SCIENCE, 2000, 237 (1-2) : 1 - 32
[10] The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs
Courcelle, B
THEORETICAL COMPUTER SCIENCE, 1999, 224 (1-2) : 35 - 58

← 1 2 3 4 5 →