title: ÐÐ¾Ð´ÐµÐ»Ñ ÑÐ·ÑÐºÐ° Ð¸Ð½ÑÐµÑÐ¿ÑÐµÑÐ¸ÑÑÐµÐ¼ÑÑ ÑÐµÐ¿Ð¾ÑÐµÐº ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð¿ÑÐµÐ¾Ð±ÑÐ°Ð·Ð¾Ð²Ð°Ð½Ð¸Ð¹
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: The model of the language of interpreted chains of complex transformations
Creators: name: ÐÐµÑÑÑÑÐºÐ¾Ð², ÐÐ°Ð½Ð¸Ð»
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2021
Subjects: ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½Ð¾Ðµ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½Ð¾Ðµ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ðµ
Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸ÑÐµÑÐºÐ°Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ° Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹
ÑÐ·ÑÐº ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½ÑÑ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹
symbolic complex expression
automatic expression validation
symbolic complex expression language

description: ÐÐ°Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐµ ÑÐ·ÑÐºÐ° ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½ÑÑ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹ Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÑÐºÐ²Ð¸Ð²Ð°Ð»ÐµÐ½ÑÐ½Ð¾ÑÑÐ¸ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹, Ð·Ð°Ð¿Ð¸ÑÐ°Ð½Ð½ÑÑ Ð½Ð° Ð´Ð°Ð½Ð½Ð¾Ð¼ ÑÐ·ÑÐºÐµ. Ð¦ÐµÐ»ÑÑ ÑÐ°Ð±Ð¾ÑÑ ÑÐ²Ð»ÑÐµÑÑÑ Ð¿Ð¾Ð²ÑÑÐµÐ½Ð¸Ðµ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ Ð¿ÑÐ¾ÑÐµÑÑÐ° Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ Ð¿ÑÑÐµÐ¼ Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸Ð·Ð°ÑÐ¸Ð¸ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÑÐµÑÐ°ÐµÐ¼ÑÑ Ð² ÑÐ¾Ð´Ðµ Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°Ñ. Ð ÑÐ¾Ð´Ðµ ÑÐ°Ð±Ð¾ÑÑ Ð¿ÑÐ¾Ð´ÐµÐ»Ð°Ð½Ð¾: 1.Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð° Ð¿Ð¾ÑÐ¾Ð¶Ð´Ð°ÑÑÐ°Ñ Ð³ÑÐ°Ð¼Ð¼Ð°ÑÐ¸ÐºÐ° ÐºÐ»Ð°ÑÑÐ° ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½ÑÑ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹ 2.Ð¯Ð·ÑÐº ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½ÑÑ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹ Ð²Ð½ÐµÐ´ÑÐµÐ½ Ð² ÑÐ¸ÑÑÐµÐ¼Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ¸ TWF 3.Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹, Ð·Ð°Ð¿Ð¸ÑÐ°Ð½Ð½ÑÑ Ð½Ð° Ð´Ð°Ð½Ð½Ð¾Ð¼ ÑÐ·ÑÐºÐµ. Ð Ð°Ð±Ð¾ÑÐ° Ð² Ð¾ÑÐ½Ð¾Ð²Ð½Ð¾Ð¼ Ð¿ÑÐ¾Ð²Ð¾Ð´Ð¸Ð»Ð°ÑÑ Ñ ÐºÐ¾Ð´Ð¾Ð²Ð¾Ð¹ Ð±Ð°Ð·Ð¾Ð¹ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ¸ TWF. Ð¡ÑÑÐµÑÑÐ²ÑÑÑÐ¸Ð¹ Ð¸Ð½ÑÐµÑÐ¿ÑÐµÑÐ°ÑÐ¾Ñ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð±ÑÐ» Ð´Ð¾ÑÐ°Ð±Ð¾ÑÐ°Ð½ Ð² ÑÐ¾Ð¾ÑÐ²ÐµÑÑÑÐ²Ð¸Ð¸ Ñ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ð¹ Ð³ÑÐ°Ð¼Ð¼Ð°ÑÐ¸ÐºÐ¾Ð¹. ÐÐ¾ÑÐ»Ðµ ÑÑÐ¾Ð³Ð¾ Ð±ÑÐ» ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹. Ð¢ÐµÐ¾ÑÐµÑÐ¸ÑÐµÑÐºÐ°Ñ Ð·Ð½Ð°ÑÐ¸Ð¼Ð¾ÑÑÑ Ð¿ÑÐ¾Ð´ÐµÐ»Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ Ð·Ð°ÐºÐ»ÑÑÐ°ÐµÑÑÑ Ð² ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ð¹ Ð¼Ð¾Ð´ÐµÐ»Ð¸ ÑÐ·ÑÐºÐ° ÑÐ¸Ð¼Ð²Ð¾Ð»ÑÐ½ÑÑ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÐ½ÑÑ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹ Ð¸ ÐµÐ³Ð¾ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸, Ð° ÑÐ°ÐºÐ¶Ðµ Ð² Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ðµ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÑÐºÐ²Ð¸Ð²Ð°Ð»ÐµÐ½ÑÐ½Ð¾ÑÑÐ¸ Ð²ÑÑÐ°Ð¶ÐµÐ½Ð¸Ð¹, Ð½Ð° Ð½ÐµÐ¼ Ð·Ð°Ð¿Ð¸ÑÐ°Ð½Ð½ÑÑ. ÐÑÐ°ÐºÑÐ¸ÑÐµÑÐºÐ°Ñ Ð·Ð½Ð°ÑÐ¸Ð¼Ð¾ÑÑÑ Ð·Ð°ÐºÐ»ÑÑÐ°ÐµÑÑÑ Ð² ÑÐ¾Ð¼, ÑÑÐ¾ Ð¿Ð¾Ð»ÑÑÐµÐ½Ð½ÑÐµ ÑÐ·ÑÐº Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð²Ð½ÐµÐ´ÑÐµÐ½Ñ Ð² ÑÐ¸ÑÑÐµÐ¼Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ¸ TWF, ÐºÐ¾ÑÐ¾ÑÐ°Ñ ÑÐ²Ð»ÑÐµÑÑÑ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ¾Ð¹ Ð´Ð»Ñ ÑÐ¶Ðµ ÑÑÑÐµÑÑÐ²ÑÑÑÐ¸Ñ Ð¸Ð³ÑÑ Matify Ð¸ Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÐ° Ð´Ð»Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð·Ð°Ð´Ð°Ñ TWF.
description: The given work is devoted to development of a complex symbolic expression language and an algorithm for checking the equivalence of complex expressions writ-ten in this language. The purpose of the work is to increase the efficiency of the learning process by automating the verification of tasks solved during the training. Tasks completed during the work: 1.The generating grammar of the class of symbolic complex expressions is developed 2.The language of symbolic complex expressions is implemented in the TWF library validation system 3.An algorithm for checking complex expressions written in this language has been developed. The work was mainly carried out with the code base of the TWF library. The existing expression interpreter of the validation system has been modified in accordance with the developed grammar. After that, an algorithm for checking complex expressions was developed. The theoretical significance of this work lies in the developed model of the language of symbolic complex expressions and its implementation, as well as in the algorithm for checking the equivalence of expressions written on it. The practical significance lies in the fact that the resulting language and algorithm are embedded in the TWF library verification system, which is a library for an existing game called Matify and a web service called TWF for checking tasks.