On Families of Graphs Having a Decidable First Order Theory with Reachability-Reference-Cited by-同舟云学术

On Families of Graphs Having a Decidable First Order Theory with Reachability

Published:2002 Issue: Volume: Page:98-109
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Colcombet Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_10

Reference16 articles.

1. K. Barthelmann. When can equational simple graphs be generated by hyperedge replacement? Technical report, University of Mainz, 1998.

2. A. Blumensath and E. Grädel. Automatic Structures. In Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000, pages 51–62, 2000.

3. Lect Notes Comput Sci;D. Caucal,1996

4. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata , 1997.

5. B. Courcelle. Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach. Elsevier, 1990.

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

1. Rewriting Higher-Order Stack Trees;Theory of Computing Systems;2017-05-02

2. Shuffled languages—Representation and recognition;Theoretical Computer Science;2013-06

3. Optimizing Network Topology for Cascade Resilience;Handbook of Optimization in Complex Networks;2011-10-27

4. On external presentations of infinite graphs;Electronic Proceedings in Theoretical Computer Science;2009-11-17

5. Synthesis for Structure Rewriting Systems;Mathematical Foundations of Computer Science 2009;2009