Skip to main content
SpringerLink
Log in

Algorithm for the enumeration of permutations with finite repetition

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Authors
  1. B. M. Zlotnik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Moscow. Translated from Kibernetika, No. 5, pp. 100–102, September–October, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zlotnik, B.M. Algorithm for the enumeration of permutations with finite repetition. Cybern Syst Anal 7, 875–878 (1971). https://doi.org/10.1007/BF01641509

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01641509

Keywords

Search

Navigation