Article citationsMore>>

Abramyan, M. (2021) Computing the Weight of Subtasks in State Minimization of Nondeterministic Finite Automata by the Branch and Bound Method. University proceedings. Volga Region. Physical and Mathematical Sciences, 2, 46-52. (In Russian)

has been cited by the following article:

• 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.