Defining Properties of Primitive Systems of Natural Numbers
The structure of set of primitive systems of natural numbers is described and the main properties of primitive systems are installed. With usage of concepts deadlockness and fe-minimalities of primitive systems the algorithm of listing of primitive systems of the numbers which are not exceeding the...
Main Authors: | S. N. Kyazhin, V. M. Fomichev |
---|---|
Format: | Article |
Language: | English |
Published: |
Moscow Engineering Physics Institute
2012-03-01
|
Series: | Bezopasnostʹ Informacionnyh Tehnologij |
Subjects: | |
Online Access: | https://bit.mephi.ru/index.php/bit/article/view/529 |
Similar Items
Similar Items
-
Analysis Algorithms of Primitiveness of the Directed Graphs
by: S.N. Kyazhin, et al.
Published: (2012-03-01) -
Some remarks on certain classes of semilattices
by: P. V. Ramana Murty, et al.
Published: (1982-01-01) -
The minimum exponent of the primitive digraphs on the given number of arcs
by: Jolanta Rosiak
Published: (2004-01-01) -
A metrizable Lawson semitopological semilattice with non-closed partial order
by: Taras Banakh, et al.
Published: (2020-10-01) -
Testing Primitive Polynomials for Generalized Feedback Shift Register Random Number Generators
by: Lian, Guinan
Published: (2005)