Part 3. Mathematical models

Comlexity of implementation of A-closure elementary basis in lineary automata class on finite field

I. Ilin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

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 find the complexity estimation for elementary basis realization by A-closure operations in linear automata under finite field [4].

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