Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

The class of Moore linear automata

Abstract

It is shown that the class of linear Moore automata equipped with an approximation-closure operator contains no precomplete classes and no basis, but does contain a continuum of closed classes.

Keywords: linear automaton, Moore automaton, approximation closure, completeness, expressibility, closed class, precomplete class.

BibTeX
@article{IS-Chasovskikh2026,
  author  = {Chasovskikh, Anatoly Alexandrovich},
  title   = {{The class of Moore linear automata}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {135--138},
}
AMSBIB
\Bibitem{IS-Chasovskikh2026}
\by A.\,A.~Chasovskikh
\paper The class of Moore linear automata
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 135--138
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover