Finding small counterexamples for abstract rewriting properties.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1485, doi. 10.1017/S0960129518000221
- By:
- Publication type:
- Article
Works matching IS 09601295 AND DT 2018 AND VI 28 AND IP 8
Results: 7
1
2
Interactive and automated proofs for graph transformations.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1333, doi. 10.1017/S096012951800021X
- By:
- Publication type:
- Article
3
Linear pattern matching of compressed terms and polynomial rewriting.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1415, doi. 10.1017/S0960129518000208
- By:
- Publication type:
- Article
4
Foreword: special issue on term and graph rewriting.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1287, doi. 10.1017/S0960129518000191
- By:
- Publication type:
- Article
5
Recognizable languages of arrows and cospans.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1290, doi. 10.1017/S096012951800018X
- By:
- Publication type:
- Article
6
Non-size increasing graph rewriting for natural language processing.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1451, doi. 10.1017/S0960129518000178
- By:
- Publication type:
- Article
7
Convergence in infinitary term graph rewriting systems is simple.
- Published in:
- Mathematical Structures in Computer Science, 2018, v. 28, n. 8, p. 1363, doi. 10.1017/S0960129518000166
- By:
- Publication type:
- Article