TITLE:
On Some Systems of Word Equations for Automata
AUTHORS:
Nikolai I. Krainukov, Mikhail E. Abramyan, Boris F. Melnikov
KEYWORDS:
Finite Automata, Word Equation, Free Algebra, Regular Expressions, Normal Forms
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.12 No.12,
December
31,
2024
ABSTRACT: 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.