Skip to main content

3 Result(s)

within Chapter Remove this filter A. A. Markov Remove this filter

and

  1. No Access

    Chapter

    Nonrecurrent Codes with Minimal Decoding Complexity

    Let U be a finite system of distinct words in the alphabet A, 𝔄 a free semigroup over A, [U] a subsemigroup of 𝔄, generated by the set U, and λ the empty word. By ||X|| we shall denote the number of elements o...

    A. A. Markov in Systems Theory Research (1973)

  2. No Access

    Chapter

    On a Semantical Language Hierarchy in a Constructive Mathematical Logic

    The subject of this paper is a constructive mathematical logic, i.e. a logic suitable for constructive mathematics. Constructive mathematics differs radically from classical mathematics in the understanding of...

    A. A. Markov in Logic, Foundations of Mathematics, and Computability Theory (1977)

  3. No Access

    Chapter and Conference Paper

    Computational problems in alphabetic coding theory

    M. Yu. Baryshev, L. P. Zhil'tzova, A. A. Markov in Fundamentals of Computation Theory (1987)