Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Courcelle, Bruno
1995.
Computer Science Logic.
Vol. 933,
Issue. ,
p.
163.
Courcelle, Bruno
and
Lagergren, Jens
1996.
Equivalent definitions of recognizability for sets of graphs of bounded tree-width.
Mathematical Structures in Computer Science,
Vol. 6,
Issue. 2,
p.
141.
Courcelle, Bruno
1996.
The monadic second-order logic of graphs X: Linear orderings.
Theoretical Computer Science,
Vol. 160,
Issue. 1-2,
p.
87.
Courcelle, Bruno
1996.
Basic notions of universal algebra for language theory and graph grammars.
Theoretical Computer Science,
Vol. 163,
Issue. 1-2,
p.
1.
Cosmo, Roberto
and
Kesner, Delia
1996.
Computer Science Logic.
Vol. 1092,
Issue. ,
p.
215.
Courcelle, Bruno
1996.
Graph Grammars and Their Application to Computer Science.
Vol. 1073,
Issue. ,
p.
487.
Ghani, Neil
1997.
Typed Lambda Calculi and Applications.
Vol. 1210,
Issue. ,
p.
164.
Thiemann, Peter
1997.
TAPSOFT '97: Theory and Practice of Software Development.
Vol. 1214,
Issue. ,
p.
742.
Ghani, Neil
1997.
Computer Science Logic.
Vol. 1258,
Issue. ,
p.
182.
Xi, Hongwei
1997.
Logical Foundations of Computer Science.
Vol. 1234,
Issue. ,
p.
399.
Cosmo, Roberto
and
Ghani, Neil
1997.
Automata, Languages and Programming.
Vol. 1256,
Issue. ,
p.
237.
Bex, Geert Jan
Maneth, Sebastian
and
Neven, Frank
2002.
A formal model for an expressive fragment of XSLT.
Information Systems,
Vol. 27,
Issue. 1,
p.
21.
Courcelle, Bruno
and
Weil, Pascal
2005.
The recognizability of sets of graphs is a robust property.
Theoretical Computer Science,
Vol. 342,
Issue. 2-3,
p.
173.
Blumensath, A.
and
Courcelle, B.
2006.
Recognizability, hypergraph operations, and logical types.
Information and Computation,
Vol. 204,
Issue. 6,
p.
853.
Bruggink, H.J. Sander
König, Barbara
and
Küpper, Sebastian
2015.
Robustness and closure properties of recognizable languages in adhesive categories.
Science of Computer Programming,
Vol. 104,
Issue. ,
p.
71.