Kunc M., “The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable”, Fundamentals of Computation Theory, Proceedings, Lecture Notes in Computer Science, 4639, eds. CsuhajVarju E., Esik Z., Springer-Verlag Berlin, 2007, 365–375
César L. Alonso, David Alonso, Mar Callau, José Luis Montaña, Lecture Notes in Computer Science, 4827, MICAI 2007: Advances in Artificial Intelligence, 2007, 316
Temur Kutsia, Jordi Levy, Mateu Villaret, Lecture Notes in Computer Science, 4533, Term Rewriting and Applications, 2007, 288
Diekert V., Muscholl A., “Solvability of Equations in Graph Groups Is Decidable”, Int. J. Algebr. Comput., 16:6 (2006), 1047–1069
Zhang T., Sipma H.B., Manna Z., “Decision Procedures for Term Algebras with Integer Constraints”, Inf. Comput., 204:10 (2006), 1526–1574
Kuske D., Lohrey M., “Logical Aspects of Cayley-Graphs: the Monoid Case”, Int. J. Algebr. Comput., 16:2 (2006), 307–340
Kuske D., “Theories of Orders on the Set of Words”, Rairo-Theor. Inform. Appl., 40:1 (2006), 53–74
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret, Lecture Notes in Computer Science, 4098, Term Rewriting and Applications, 2006, 400
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret, Lecture Notes in Computer Science, 4130, Automated Reasoning, 2006, 82
F. Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis, Lecture Notes in Computer Science, 4162, Mathematical Foundations of Computer Science 2006, 2006, 167