RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1981 Volume 17, Issue 4, Pages 119–123 (Mi ppi1425)
Ņorrespondence

On Some Properties of $Q$-Complexity of Finite Objects

E. Z. Dyment


Abstract: We introduce and examine the notion of a $Q$-complexity of a word $x$ (complexity of finding a word to which $x$ is related with respect to relation $Q$).

UDC: 621.391.1:519.2

Received: 05.10.1978
Revised: 18.03.1981



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025