RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2009 Number 2(4), Pages 26–49 (Mi pdm59)

This article is cited in 1 paper

Theoretical Foundations of Applied Discrete Mathematics

Discrete automata on semilattices

G. P. Agibalov

Tomsk State University, Tomsk, Russia

Abstract: The theory of discrete automata on semilattices is one of the important achivements of the Tomsk State University scientific School on applied discrete mathematics. It is a comparatively young branch of the science connecting mathematical cybernetics and abstract algeabras. Inside this branch, we have firstly succeeded in formal defining such notions related to the discrete control systems as the dynamic behaviour, the hardware realizability, the adequate model and its accuracy, and also in solving the problems of logical synthesizing such systems with a given dynamic behaviour and with the possibility of hardware realization at the transistor level and of modelling their dynamic behaviour adequately with any given accuracy. The paper is presented on behalf of 50 years jubilee of the School. It is an extended abstract of the same name monograph by the author issued at TSU in 1993 and now being out of access. All the main results obtained in the theory of discrete automata up to that time are presented in the paper.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2024