Jordi Levy, Mateu Villaret, Lecture Notes in Computer Science, 2378, Rewriting Techniques and Applications, 2002, 326
Sabrina Mantaci, Antonio Restivo, “Codes and equations on trees”, Theoretical Computer Science, 255:1-2 (2001), 483
Karhumaki J., Mignosi F., Plandowski W., “On the Expressibility of Languages by Word Equations with a Bounded Number of Variables”, Bull. Belg. Math. Soc.-Simon Steven, 8:2 (2001), 293–305
Beauquier J., Berard B., Fribourg L., Magniette F., “Proving Convergence of Self-Stabilizing Systems Using First-Order Rewriting and Regular Languages”, Distrib. Comput., 14:2 (2001), 83–95
Diekert V., Muscholl A., “Solvability of Equations in Free Partially Commutative Groups Is Decidable”, Automata Languages and Programming, Proceeding, Lecture Notes in Computer Science, 2076, eds. Orejas F., Spirakis P., VanLeeuwen J., Springer-Verlag Berlin, 2001, 543–554
Baader F., Schulz K., “Combining Constraint Solving”, Constraints in Computational Logics: Theory and Applications, Lecture Notes in Computer Science, 2002, eds. Comon H., Marche C., Treinen R., Springer-Verlag Berlin, 2001, 104–158
Manfred Schmidt-Schauß, Lecture Notes in Computer Science, 2142, Computer Science Logic, 2001, 498
Jordi Levy, Mateu Villaret, Lecture Notes in Computer Science, 2051, Rewriting Techniques and Applications, 2001, 169
Joachim Niehren, Tim Priesnitz, Lecture Notes in Computer Science, 2215, Theoretical Aspects of Computer Software, 2001, 360
Joachim Niehren, Alexander Koller, Lecture Notes in Computer Science, 2014, Logical Aspects of Computational Linguistics, 2001, 199