This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
F. Flajobet, “Analyse d'algorithmes de manipulation d'arbres et de fichiers,” Can. Bur. Univ. Rech. Oper., Nos. 34–35, 1–209 (1981).
G. P. Kozhevnikova, “Automation of the analysis of the computational complexity of algorithm,” Kibernetika, No. 5, 65–73 (1980).
A. P. Zavada and G. P. Kozhevnikova, “Problems of complexity analysis of algorithms,” Kibernetika, No. 6, 124–125 (1980).
A. B. Vinokur and G. P. Kozhevnikova “Analysis of the efficiency of an algorithm on the basis of an ABC-1 analyzer,” in: Theoretical and Systemic Programming [in Russian], IK AN UkrSSR, Kiev (1979), pp. 56–66.
M. Hellerman, “Parallel processing of algebraic expressions,” IEEE Trans.,15, No. 1, 82–91 (1966).
A. Berztiss, Data Structures [Russian translation], Statistika, Moscow (1974).
A. B. Vinokur and G. P. Kozhevnikova, A Class of Regular Trees Used in Complexity Analysis of Algorithms [in Russian], No. 82-18, Preprint of the Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1982).
D. E. Knuth, The Art of Computer Programming: Fundamental Algorithms, Vol. 1, 2nd Ed., Addison-Wesley, Reading MA (1974).
L. P. Lisovik, “Finite transducers over marked trees and quasiidentities in a free semigroup,” Probl. Kibern., No. 40, 19–41 (1983).
T. Kamimura, “Tree automata and attribute grammars,” Lect. Notes. Comput. Sci.,154, 374–384 (1983).
F. Gëcseg and M. Steinby, Tree Automata, Akad. Kiado, Budapest (1984).
G. P. Kozhevnikova, “Estimating the efficiency of algorithms of symbol transformation,” Upr. Sist. Mash., No. 1, 98–102 (1974).
A. B. Vinokur and G. P. Kozhevnikova, Formalized Analysis of Complexity of Hierarchical Algorithms Based on Recognizing Their Classification Properties [in Russian], No. 86-9, Preprint of the Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1986).
Translated from Kibernetika, No. 3, pp. 35–44, May–June, 1987
About this article
Cite this article
Vinokur, A.B., Kozhevnikova, G.P. Functions of binary trees and their applications in algorithm complexity analysis. Cybern Syst Anal 23, 328–340 (1987). https://doi.org/10.1007/BF01074824
- Operating System
- Artificial Intelligence
- System Theory
- Complexity Analysis
- Binary Tree