Baba K., Tsuruta S., Shinohara A., Takeda M., “On the Length of the Minimum Solution of Word Equations in One Variable”, Mathematical Foundations of Computer Science 2003, Proceedings, Lecture Notes in Computer Science, 2747, eds. Rovan B., Vojtas P., Springer-Verlag Berlin, 2003, 189–197
Kuske D., Lohrey M., “Decidable Theories of Cayley-Graphs”, Stacs 2003, Proceedings, Lecture Notes in Computer Science, 2607, eds. Alt H., Habib M., Springer-Verlag Berlin, 2003, 463–474
Joachim Niehren, Tim Priesnitz, “Non-structural subtype entailment in automata theory”, Information and Computation, 186:2 (2003), 319
В. Ю. Попов, “О позитивных теориях многообразий и псевдомногообразий полугрупп”, Фундамент. и прикл. матем., 8:2 (2002), 631–635
Sergei Vorobyov, “∀∃5-equational theory of context unification is undecidable”, Theoretical Computer Science, 275:1-2 (2002), 463
Manfred Schmidt-Schauß, Klaus U. Schulz, “Solvability of Context Equations with Two Context Variables is Decidable”, Journal of Symbolic Computation, 33:1 (2002), 77
Temur Kutsia, “Pattern Unification with Sequence Variables and Flexible Arity Symbols”, Electronic Notes in Theoretical Computer Science, 66:5 (2002), 52
Diekert V., Lohrey M., “A Note on the Existential Theory of Equations in Plain Groups”, Int. J. Algebr. Comput., 12:1-2 (2002), 1–7
Karhumaki J., Lisovik L., “The Equivalence Problem of Finite Substitutions on Abc, with Applications”, Automata, Languages and Programming, Lecture Notes in Computer Science, 2380, eds. Widmayer P., Triguero F., Morales R., Hennessy M., Eidenbenz S., Conejo R., Springer-Verlag Berlin, 2002, 812–820
Temur Kutsia, Lecture Notes in Computer Science, 2385, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, 2002, 290