On Some Systems of Word Equations for Automata  

作　　者：Nikolai I. Krainukov Mikhail E. Abramyan Boris F. Melnikov Nikolai I. Krainukov;Mikhail E. Abramyan;Boris F. Melnikov(Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, Shenzhen, China;Algebra and Discrete Mathematics Department, Southern Federal University, Rostov-on-Don, Russian Federation)

机构地区：[1]Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, Shenzhen, China [2]Algebra and Discrete Mathematics Department, Southern Federal University, Rostov-on-Don, Russian Federation

出　　处：《Journal of Applied Mathematics and Physics》2024年第12期4322-4332,共11页应用数学与应用物理(英文)

摘　　要：In this paper, we use some programing tools and algorithms for solving system of word equation for regular languages. There are many possibilities for presentation of regular languages such as grammars, finite automata, rewriting systems and so on. Some of these systems is presented by system of computational discrete algebra GAP and the possibilities of presentation now in some systems interactive theorem provers (Isabelle, Coq). This computer system can give to detailed understanding of solution of system of word equation, compared the languages and regular expressions of the languages.In this paper, we use some programing tools and algorithms for solving system of word equation for regular languages. There are many possibilities for presentation of regular languages such as grammars, finite automata, rewriting systems and so on. Some of these systems is presented by system of computational discrete algebra GAP and the possibilities of presentation now in some systems interactive theorem provers (Isabelle, Coq). This computer system can give to detailed understanding of solution of system of word equation, compared the languages and regular expressions of the languages.

关 键 词：Finite Automata Word Equation Free Algebra Regular Expressions Normal Forms 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]