This is a preview of subscription content, log in via an institution to check access.
REFERENCES
Sh. M. Aliev, “Algorithmic problems of the design of optimal codes for multiple receivers,” Dissertation, Moscow (1993).
G. Burosch, U. Frankl, and S. Rohl, “Ñber Ordnungen von Binaworten,” Rostock.Math.Kolloq., 39, 53–64 (1990).
K. Engel and H.-D. Gronan, Sperner Theory in Partially Ordered Sets, BSB B.G. Teubner Verlagsgesellschaft, Leipzig (1985).
A. A. Evdokimov, “On the maximum length ofa chain in the n-dimensional Boolean cube,” Mat.Zametki, 6, No. 3, 309–319 (1969).
A. A. Evdokimov and V. Nyu, “The length of a supersequence for the set of binary words with a given number of units,” in: Discrete Analysis Method in Graph Theory and Complexity [in Russian], Scientific Publications of the Institute of Mathematics of the Siberian Division of the Russian Academy of Sciences, Novosibirsk, 52 (1969), pp. 49–58.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco (1979).
Yu. I. Zhuravlev, “On the algorithms for simplification for disjunctive normal forms,” Dokl.Akad. Nauk SSSR, 132, No. 2, 260–263 (1960).
F. P. Gorelik, I. B. Gurevich, and V. A. Skripkin, Contemporary State of the Pattern Recognition Problem [in Russian], Moscow, Radio i Svyaz' (1985).
M. Hall, Combinatorial Theory, Blaisdell, Waltham-Toronto-London (1967).
F. Harari, “On the reconstruction of a graph from a collection of subgraphs,” in: Graph Theory and Its Applications, Prague (1964), pp. 47–52.
F. Harari and E. M. Palmer, “The reconstruction of a tree from its maximal proper subtrees,” Can.J.Math., 18, 803–810 (1966).
V. V. Kalashnik, “Reconstruction ofw ords by their fragments,” Vychisl.Mat.Vychisl.Tekh. (Kharkov), 4, 56–57 (1973).
V. K. Leont'ev, Recognition of binary words using their fragments,” Dokl.Ross.Akad.Nauk, 330, No. 4, 434–436 (1993).
V. K. Leont'ev, “Problems of reconstruction of words using fragments and their applications,” Diskret.Anal.Issled.Operatsii, 2, No. 2, 26–48 (1995).
V. K. Leont'ev and Yu. G. Smetanin, “On the reconstruction of a vector by using a set of its fragments,” Dokl.Akad.Nauk SSSR, 302, No. 6, 1319–1322 (1988).
V. I. Levenshtein, “Elements of coding theory,” in: Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Nauka, Moscow (1974), pp. 207–305.
V. I. Levenshtein, “Binary codes correcting symbol deletion, insertion, and substitution,” Dokl.Akad.Nauk SSSR, 163, No. 4, 707–710 (1965).
V. I. Levenshtein, “Perfect codes in the metrics of deletions and insertions,” Diskret.Mat., 3, No. 1, 3–20 (1991).
V. I. Levenshtein, “Reconstruction of objects using a minimal number of corrupted samples,” Dokl.Ross.Akad.Nauk, 354, No. 5, 593–596 (1997).
M. Lothaire, Combinatorics of Words, Encyclopedia of Mathematics and Its Applications. Vol. 17, Addison-Wesley, Reading, Mass.
D. Maier, “The complexity of some problems on subsequences and supersequences,” J.Assoc.Comput.Mach., 25, No. 2, 322–336 (1978).
B. Manvel, A. Meyerowitz, A. Schwenk, K. Smith, and P. Stockmeyer, “Reconstruction of sequences,” Discr.Math., 94, No. 3, 209–219 (1991).
V. Nyu, “Covering the set of words by chains,” Dissertation, Novosibirsk (1990).
V. Nyu and A. A. Evdokimov, “Covering graphs by routes,” in: Methods of Discrete Analysis in Optimization of Control Systems [in Russian], Institute of Mathematics of the Siberian Department of the Russian Acad. Sci., 40 (1983), pp. 72–86.
W. V. Quine, “On cores and prime implicants of truth functions,” Amer.Math.Month., 66, No. 9, 755–760 (1959).
E. M. Reingold, J. Nievergeld, and N. Deo, Combinatorial Algotithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey (1977).
C. Shannon, Collected Papers, IEEE Press, New York (1993).
I. Simon, “Piecewise testable events. Automata theory and formal languages,” Lect.Notes Comput.Sci., 33, 214–222 (1975).
Ya. S. Smetanich, “On the reconstruction of words,” Dokl.Akad.Nauk SSSR, 201, No. 4, 798–800 (1971).
Ya. S. Smetanich, “On the reconstruction of words,” Tr.Mat.Inst.Akad.Nauk SSSR, Nauka, Moscow, 83, 183–202 (1971).
Yu. G. Smetanin, “Some problems of reconstructing words using their fragments,” Dissertation, Moscow (1986).
W. T. Tutte, Graph Theory, Addison-Wesley, Reading, Mass. (1984).
S. V. Yablonskii</del>, “Functional constructions in k-valued logics,” Tr.Mat.Inst.Akad.Nauk SSSR, 51 (1958).
A. I. Zenkin and V. K. Leont'ev, “A nonclassical recognition problem,” Zh.Vychisl.Mat.Mat.Fiz., 24, No. 6, 925–931 (1984).
Yu. I. Zhuravlev, “An algebraic approach to recognition and classification problems,” Probl.Kibern., 33, 5–68 (1978); English transl.: “Pattern recognition and image processing,” Adv.Math.Theory Appl., 8, No. 1, 59–100 (1998).
Rights and permissions
About this article
Cite this article
Leont'ev, V.K., Smetanin, Y.G. Problems of Information on the Set of Words. Journal of Mathematical Sciences 108, 49–70 (2002). https://doi.org/10.1023/A:1012705332306
Issue Date:
DOI: https://doi.org/10.1023/A:1012705332306