Abstract
The problem of efficient coding of sentences in stochastic context-free languages is considered. A grammatical interpretation of the problem is proposed, in which coding and decoding are treated as processes of word generation and word analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. V. Ramamoorthy and B. W. Wah, “Data management in distributed data bases,” AFIPS National Comput. Conf.,48, 325–329 (1979).
“The practicality of source coding (panel discussion),” in: J. H. Skwirczynski, ed., Communication Systems and Random Process Theory, Sijthof & Noordhof, Amsterdam (1979).
D. A. Lelewer and D. S. Hirschberg, “Data compression,” ACM Comput. Surveys,19, No. 3, 262–296 (1987).
Al. A. Markov, “On dependence of the efficiency of alphabet coding on the language of messages,” Dokl. Akad. Nauk SSSR,258, No. 2, 231–234 (1981).
A. A. Markov, An Introduction to Coding Theory [in Russian], Nauka, Moscow (1982).
L. P. Zhil'tsova, “On alphabet coding of context-free languages,” in: Combinatorial-Algebraic Methods in Applied Mathematics [in Russian], Izd. Gor'kovsk. Univ. (1983), pp. 106–123.
Al. A. Markov and T. G. Smirnova, “Algorithmic foundations of generalized-prefix coding,” Dokl. Akad. Nauk SSSR,274, No. 4, 790–793 (1984).
L. P. Zhil'tsova, “On efficiency of alphabet coding of context-free languages,” Combinatorial-Algebraic Methods in Applied Mathematics [in Russian], Izd. Gor'kovsk. Univ. (1985), pp. 65–76.
L. P. Zhil'tsova and A. A. Markov, “On combinatorial-logical coding models,” Abstracts of papers at 8th All-Union Conf. on Mathematical Logic [in Russian], Moscow (1987), p. 66.
A. A. Markov and T. G. Smirnova, “Locally prefix codes,” Combinatorial-Algebraic Methods and Their Application [in Russian], Izd. Gor'kovsk. Univ. (1987), p. 70.
L. P. Zhil'tsova, “On complexity of algorithmic problems of language coding for various classes of coding mappings,” Combinatorial-Algebraic and Probabilistic Methods in Applied Mathematics [in Russian] (1988), pp. 35–44.
L. P. Zhil'tsova, “On algorithmic complexity of problems of optimal alphabet coding for context-free languages,” Diskret. Matem.,1, No. 2, 38–51 (1989).
A. V. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Parsing, Prentice Hall, Englewood Cliffs, NJ (1972).
G. V. Cormack, “Data compression of a data base system,” Comm. ACM,28, No. 12, 1041–1050 (1986).
D. E. Boeckee, R. A. Kraak, and E. Backer, “Complexity and syntactic information,” IEEE Trans. Systems, Man and Cybernetics,12, No. 1, 87–96 (1982).
V. A. Bushenkov and I. A. Sheremet, “Management system for nonformalized data bases for personal computers,” Proc. All-Union Sci. Conf. on Problems of Simulation of Economic Experiments [in Russian], VNIIPOU GKNT SSSR, Moscow (1986), pp. 221–222.
Yu. V. Korzhenevich and I. A. Sheremet, “Optimization of logical inference in real-time symbolic-production expert systems with large knowledge bases,” Proc. Intern. Symp. on Informatics INFO-89 [in Russian], Vol. 1, Part 2 (1989), pp. 782–787.
E. P. Shaburov and I. A. Sheremet, “Implementation and application of symbolic-production intelligent software environments,” USiM, No. 5, 34–47 (1991).
E. K. Gordienko, “Implementation of a search procedure in Prolog using associative memory,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 76–84 (1984).
K. Murakami, T. Kakuta, and R. Onai, “Architecture and hardware system: parallel inference machines,” Proc. Int. Conf. on Fifth-Generation Comput. Syst. (1982), pp. 203–208.
A. Hattori, H. Masuzawa, and H. Hayashi, “AI machine,” Fujitsu Sci. Tech. J.,23, No. 4, 369–378 (1987).
P. Lewis, D. Rosenkrantz, and R. Stearns, Compiler Design Theory [Russian translation], Mir, Moscow (1979).
E. Moriya, “Associate languages and derivational complexity of formal grammars and languages,” Inform. Contr.,22, No. 1, 37–46 (1973).
E. Mäkinen, “An undecidable problem for context-free grammars,” Inform. Process. Lett.,20, No. 3, 141–142 (1985).
K. Fu, Structural Methods in Pattern Recognition [Russian translation], Mir, Moscow (1977).
V. N. Sachkov, Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1977).
Al. A. Markov, “Systems of antiprefixity equations in words,” Diskret. Matem.,2, No. 2, 11–20 (1990).
A. A. Zykov, Fundamentals of Graph Theory [in Russian], Nauka, Moscow (1987).
C. S. Wetherel, “Probabilistic languages: a review and some open questions,” ACM Comput. Surveys,12, No. 4, 361–379 (1980).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 38–52, May–June, 1992.
Rights and permissions
About this article
Cite this article
Sheremet, I.A. Efficient coding of formalized messages. Cybern Syst Anal 28, 356–367 (1992). https://doi.org/10.1007/BF01125416
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01125416