Comlexity of implementation of A-closure elementary basis in lineary
automata class on ﬁnite ﬁeld

Ilin Ivan Yurievich

Comlexity of implementation of A-closure elementary basis in lineary automata class on ﬁnite ﬁeld

Ilin I. Y.

Ilin Ivan Yurievich

graduate student, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Chair of Mathematical Theory of Intellectual Systems

Published: 2023, vol. 27, issue 2, pp. 125–141

Download full text (In Russian)

Abstract

In the previous work we have received compexity estimation for elementary basis implementation in the class of linear automata that preserves zero-sequence. In the current work we will ﬁnd the complexity estimation for elementary basis realization by A-closure operations in linear automata under ﬁnite ﬁeld [4].

Keywords: linear automata, A-closure, A-expressibility, algorithm complexity.

BibTeX

@article{IS-Ilin2023,
  author  = {Ilin, Ivan Yurievich},
  title   = {{Comlexity of implementation of A-closure elementary basis in lineary automata class on ﬁnite ﬁeld}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2023},
  volume  = {27},
  number  = {2},
  pages   = {125--141},
}

AMSBIB

\Bibitem{IS-Ilin2023}
\by I.\,Y.~Ilin
\paper Comlexity of implementation of A-closure elementary basis in lineary automata class on ﬁnite ﬁeld
\jour Intelligent Systems. Theory and Applications
\yr 2023
\vol 27
\issue 2
\pages 125--141
\lang In Russian

Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue