Constructing Infinite Graphs with a Decidable MSO-Theory-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Constructing Infinite Graphs with a Decidable MSO-Theory

Published:2003 Issue: Volume: Page:113-124
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2003
language:
Short-container-title:

Author:

Thomas Wolfgang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45138-9_6

Reference26 articles.

1. Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: [16], 285–302

2. Blumensath, A.: Preix-recognizable graphs and monadic second-order logic, Rep. AIB-06-2001, RWTH Aachen (2001)

3. Lecture Notes in Computer Science;A. Blumensath,2002

4. Lecture Notes in Computer Science;D. Caucal,1996

5. Lecture Notes in Computer Science;D. Caucal,2002

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algebraic Synchronization Trees and Processes;Automata, Languages, and Programming;2012

2. Monadic Σ11 and Modal Logic with Quantified Binary Relations;Electronic Notes in Theoretical Computer Science;2010-05

3. Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems;Foundations of Software Science and Computational Structures;2010

4. Linear Orders in the Pushdown Hierarchy;Automata, Languages and Programming;2010

5. Analysing scientific workflows with Computational Tree Logic;Cluster Computing;2009-08-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP