S. Cavagnetto, “The Lengths of Proofs: Kreisel's conjecture and Gödel's speed-up theorem”, Исследования по конструктивной математике и математической логике. XI, Зап. научн. сем. ПОМИ, 358, ПОМИ, СПб., 2008, 153–188 ; J. Math. Sci. (N. Y.), 158:5 (2009), 689–707
Baaz M., Wojtylak P., “Generalizing Proofs in Monadic Languages”, Ann. Pure Appl. Log., 154:2 (2008), 71–138
Paweł Parys, Lecture Notes in Computer Science, 4962, Foundations of Software Science and Computational Structures, 2008, 261
Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau, Lecture Notes in Computer Science, 5196, Language and Automata Theory and Applications, 2008, 275
Benny George Kenkireth, Samrith Ram, Lecture Notes in Computer Science, 5378, Logic and Its Applications, 2008, 224
Yuri Matiyasevich, New Computational Paradigms, 2008, 59
Temur Kutsia, “Solving equations with sequence variables and sequence functions”, Journal of Symbolic Computation, 42:3 (2007), 352
ELENA CZEIZLER, JUHANI KARHUMÄKI, “ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS”, Int. J. Found. Comput. Sci, 18:04 (2007), 873
Deis T., Meakin J., Senizergues G., “Equations in Free Inverse Monoids”, Int. J. Algebr. Comput., 17:4 (2007), 761–795
Kunc M., “What Do We Know About Language Equations?”, Developments in Language Theory, Proceedings, Lecture Notes in Computer Science, 4588, eds. Harju T., Karhumaki J., Lepisto A., Springer-Verlag Berlin, 2007, 23–27