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 条
12345