|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 11
In this paper, we return to the topic related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consid...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 11
In this paper, we return to the topic, related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
We explore the class of positive integers n that admit idempotent factorizations ??=??_??_
n
=
p
¯
q
¯
such that ??(??)|(??_-1)(??_-1)
?
(
n
)
|
(
p
¯
-
1
)
(
q
¯
-
1
)
, where ??
?
is the Carmichael lambda function. Idempotent factorizations with ??_
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohd Sazali Khalid,Sulaiman Yamin,Sri Adelila Sari
Pág. 20 - 25
Abstract ? Many students at diploma level are weak in mathematics even after spending eleven years in Malaysian education system. However, throughout the world there are research studies been done with mixed results using technology and collaborative lea...
ver más
|
|
|
|
|
|