On upper approximations in monoids of regular languages
Received: 09 Oct 2026 Revised: 22 Oct 2026 Accepted: 31 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 87–90
Abstract
We prove that the set of upper approximations of a regular language by elements of a given finitely generated monoid of regular languages is a rational effectively constructible set.
Keywords: Regular languages, approximation of languages, rational substitution, representability problem for regular languages, monoids of regular languages.
BibTeX
@article{IS-Grigorev-Afonin2026,
author = {Grigorev, Stepan Aleksandrovich and Afonin, Sergey Aleksandrovich},
title = {{On upper approximations in monoids of regular languages}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {87--90},
}
AMSBIB
\Bibitem{IS-Grigorev-Afonin2026}
\by S.\,A.~Grigorev, S.\,A.~Afonin
\paper On upper approximations in monoids of regular languages
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 87--90
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU