\(\omega\)-languages">

Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

On equality of classes of automata-implementable and prefix-regular \(\omega\)-languages

Abstract

This paper introduces and explores the concepts of automata-implementable and prefix-regular \(\omega\)-languages. The equality of these classes is shown. Some other properties are also shown, specifically: regularity of set of words and omni-regularity of set of superwords of automata-implementable \(\omega\)-language, the uniqueness of reduced automaton for automata-implementable \(\omega\)-language and some cardinality combinations for set of words and set of superwords of automata-implementable \(\omega\)-language are described.

Keywords: finite automaton, language, regular language, hardware-final automaton, $\omega $-language, prefix-regular $\omega $-language, automata-implementable $\omega $-language.

BibTeX
@article{IS-Ushakova2026,
  author  = {Ushakova, Valentina Vladimirovna},
  title   = {{On equality of classes of automata-implementable and prefix-regular $\omega $-languages}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {131--134},
}
AMSBIB
\Bibitem{IS-Ushakova2026}
\by V.\,V.~Ushakova
\paper On equality of classes of automata-implementable and prefix-regular $\omega $-languages
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 131--134
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover