Melnikov, B. and Dolgov, V. (2022) Simplified Regular Languages and a Special Equivalence Relation on the Class of Regular Languages. Part I. International Journal of Open Information Technologies, 10, 12-20. (In Russian)

has been cited by the following article:

• TITLE: On Some Properties of Graph of Prefix Code

  AUTHORS: Nikolai I. Krainiukov, Mikhail E. Abramyan, Boris F. Melnikov

  KEYWORDS: Finite Languages, Minimal Deterministic Automata, Concatenation, Codes, Graph of Automaton, Free Algebra

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.12 No.4, April 30, 2024

  ABSTRACT: We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be decomposed into at least two nontrivial codes as the same for the languages. In the paper, a linear time algorithm is designed, which finds the prime decomposition. If codes or finite languages are presented as given by its minimal deterministic automaton, then from the point of view of abstract algebra and graph theory, this automaton has special properties. The study was conducted using system for computational Discrete Algebra GAP.