В. Г. Дурнев, “Неразрешимость простого фрагмента позитивной теории с одной константой свободной полугруппы ранга 2”, Матем. заметки, 67:2 (2000), 191–200 ; V. G. Durnev, “Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two”, Math. Notes, 67:2 (2000), 152–159
Jordi Levy, Margus Veanes, “On the Undecidability of Second-Order Unification”, Information and Computation, 159:1-2 (2000), 125
Rytter W., “Compressed and Fully Compressed Pattern Matching in One and Two Dimensions”, Proc. IEEE, 88:11, SI (2000), 1769–1778
Ilie L., Plandowski W., “Two-Variable Word Equations”, Rairo-Inform. Theor. Appl.-Theor. Inform. Appl., 34:6 (2000), 467–501
Degtyarev A., Gurevich Y., Narendran P., Veanes M., Voronkov A., “Decidability and Complexity of Simultaneous Rigid E-Unification with One Variable and Related Results”, Theor. Comput. Sci., 243:1-2 (2000), 167–184
Karhumaki J., Mignosi F., Plandowski W., “The Expressibility of Languages and Relations by Word Equations”, J. ACM, 47:3 (2000), 483–505
Gutierrez C., “Equations in Free Semigroups with Anti-Involution and their Relation to Equations in Free Groups”, Latin 2000: Theoretical Informatics, Lecture Notes in Computer Science, 1776, eds. Gonnet G., Panario D., Viola A., Springer-Verlag Berlin, 2000, 387–396
Ilie L., Plandowski W., “Two-Variable Word Equations”, Stacs 2000: 17th Annual Symposium on Theoretical Aspect of Computer Science, Lecture Notes in Computer Science, 1770, eds. Reichel H., Tison S., Springer-Verlag Berlin, 2000, 122–132
Jordi Levy, Mateu Villaret, Lecture Notes in Computer Science, 1833, Rewriting Techniques and Applications, 2000, 156
Michiel Hazewinkel, Encyclopaedia of Mathematics, 2000, 177