KIAM Main page Web Library  •  Publication Searh  Русский 

Article collection "Mathematical Problems of Cybernetics" №17, Moscow, 2008
Authors: Chasovskikh A.A.
About A-realization problems in class of linear automata functions
The approximate- realization (A- realization) problem in class of linear automata functions (l.-a. functions) through sets containing essential function and all constants in the closure is solved. The algorithm of all constants A-realization examination through finite set containing an essential function is found. For nondegenerate sets with adder of l.-a. functions the equivalence criterion of A-closure and closure operators is found.
finite automata, linear automata function, closure, A-closure, realization, A-realization, complete system, adder, delay
Publication language: russian,  pages: 32 (p. 105-136)
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
Export link to publication in format:   RIS    BibTex