Graph Operations, Graph Transformations and Monadic Second-Order Logic:-Reference-Cited by-同舟云学术

Graph Operations, Graph Transformations and Monadic Second-Order Logic:

Published:2002-05 Issue: Volume:51 Page:122-126
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Courcelle Bruno

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference11 articles.

1. D. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics. Polynomial time recognition of clique-width at most 3 graphs, Conference LATIN 2000, Lec. Notes Comp. Sci. vol. 1776, 2000. pp. 126–134.

2. The expression of graph properties and graph transformations in monadic second-order logic, Chapter 5 of the “Handbook of graph grammars and computing by graph transformations, Vol. 1: Foundations”;Courcelle,1997

3. B. Courcelle. The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications, Theoretical Computer Science, to appear.

4. B. Courcelle. Clique-width of countable graphs: a compactness property. International Conference of Graph Theory, Marseille, 2000.

5. B. Courcelle, J. Makowsky. Operations on relational structures and their compatibility with monadic second-order logic, 2000, submitted.

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

1. Non-deterministic transducer models of retransmission protocols over noisy channels;Information Processing Letters;2015-09

2. On the Complexity of Shortest Path Problems on Discounted Cost Graphs;Language and Automata Theory and Applications;2013

3. Nondeterministic Streaming String Transducers;Automata, Languages and Programming;2011