|
П |
Proofs of Partial Correctness for Attribute Grammars and Recursive Procedures |
1984 |
Courcelle B., Deransart P. |
|
|
INRIA |
Lecture Notes in Computer Science |
01.05.2002 |
|
СТ |
Graph Rewriting: An Algebraic and Logic Approach |
1994 |
Courcelle B. |
|
|
|
Handbook of Theoretical Computer Science. Formal Models and Semantics. Volume B |
27.01.1998 |
|
СТ |
Recursive Applicative Program Schemes |
1994 |
Courcelle B. |
|
|
|
Handbook of Theoretical Computer Science. Formal Models and Semantics. Volume B |
27.01.1998 |
|
СТ |
Monadic Second-Order Logic and Linear Orderings of Finite Structures |
1995 |
Courcelle B. |
Lecture Notes in Computer Science |
|
|
Computer Science Logic |
24.09.1995 |
|
СТ |
An Algebraic Theory of Graph Reduction |
1993 |
Arnborg S., Courcelle B., Proskurowski A., Seese D. |
|
|
|
J. of the ACM |
17.02.1994 |
|
СТ |
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement |
1993 |
Courcelle B. |
|
|
|
Lecture Notes in Computer Science |
16.09.1993 |
|
СТ |
Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors |
1992 |
Courcelle B. |
|
|
|
EATCS Bull. |
07.08.1992 |
|
СТ |
On constructing obstruction sets of words |
1991 |
Courcelle B. |
|
|
|
EATCS Bull. |
19.09.1991 |
