- 1 -

T NH BIN V BI TON PCP

H NGC VINH
(1)
, NGUYN NH HN
(2)
, PHAN TRUNG HUY
(3)

Tm tt: Mt m hc l mt b phn khng th tch ri ca khoa hc my tnh, n cung cp
cc phng php v k thut hiu qu cho php mt m c ng dng trong nhiu lnh vc
khc nhau ca khoa hc v cuc sng con ngi. Trong bi bo ny, chng ti s ng gp cho
mt m hc mt phng php thit lp cc h mt mi da trn by ca sp l mt dn xut
ca bi ton khng quyt nh c PCP cho lp ngn ng t nh bin.
1. GII THIU
S pht trin ca x hi dn n vic ngy nay mt m khng nhng ch c dng trong b mt
qun s v ngoi giao, m cn ch yu dng trong b mt kinh t, thng mi. Trong cc ng
dng ca mt m hc, mt nhim v rt quan trng ca mt m l m bo sao cho ch c
nhng ch nhn hay nhng ngi c thm quyn mi c th truy nhp c thng tin lu tr
trong mt h thng tin no . Phng php thc hin l m ha d liu v lu tr chng trong
h di dng c m ha. Khi nhng ngi truy nhp tri php d c c thng tin
dng m ha, th cc thng tin ny cng vn l v dng nu h khng bit cch gii m. Do
nu gi nh rng cc k thut m ha kh ph c dng th h s l an ton chng li c
nhng ngi s dng tri php. Mt h mt c th c coi l an ton, nu vn thm m l
mt bi ton bt tr [11]. V vy, khi xem xt mt h mt, cng vi n ta phi a vo nghin
cu vn tn cng. Nguyn l chung trong mt m hc l khng c mt h mt no tn ti lu
di trc s tn cng, do lun c nhu cu thit lp cc h mt mi. Phng php xy dng
cc h mt ni chung da trn nguyn l by ca sp: thng tin cng b khng hiu
bit v mt ca sp b mt.
Nhc li rng khi cp n mt s bi ton l d, kh hay bt tr, ta hiu theo ngha
phc tp tnh ton ca chng. Theo quan im mt m hc, bt k bi ton NP-y no cng
s c xem nh l bt tr, cn mt bi ton l d i hi mt gii hn a thc bc thp [11].
Cc h mt m kha cng khai ni ting nh RSA v El Gamma c thit k da trn cc bi
ton kh c nghin cu kh k lng.
Trong bi bo ny, ta thit lp mt h mt da trn mt dn xut ca bi ton khng gii
c PCP - l by ca sp mc cao nht trong phn bc kh ca cc bi ton. Bi ton
PCP (Post Correspondence Problem) c xut bi Emil Post vo nm 1946 [1]. y bi
ton thuc vo lp bi ton NP-kh, v ang c nhiu ngi quan tm nghin cu. N
thng c dng chng minh tnh khng quyt nh c ca mt s bi ton (xem thm
[2], [3], [4], [5], [6]). Bi bo c cu trc nh sau. Trc ht, trong Phn 2 ta nhc li cc
khi nim t nh bin trn bng ch ci A, -ngn ng, -ng cu v nhm v thit lp mt
s kt qu c bn v tnh on nhn c ca -otomat, quan h gia -otomat, -on nhn
c v -ngn ng chnh quy. Trong phn 3, ta xem xt bi ton PCP kinh in, t a ra
mt dn xut ca n cho lp ngn ng t nh bin to nn mt by ca sp c th ng dng
xy dng cc h mt c bo mt rt cao. Phn 4 ta a ra kt lun cho bi bo.
2. M U
Trc ht, ta nhc li cc k hiu v khi nim c trnh by chi tit trong [7, 8]. Cho
A l bng hu hn cc ch ci. Tp B = {0, 1} l tp bin. A

= {(i, a, j) | a A , i, j B} l
tp tt c cc t m rng t A v A
*

= { (i, w, j) | wA
*
, i, j B} { , e}. Khi , mi b (i, w,
j), w A
*
c gi l mt -t (t nh bin vi bin i, j), l m rng ca t w vi e, A
*
l
hai phn t mi ln lt ng vai tr l phn t zero v phn t n v ca tp cc -t A
*

.
Trn A
*

ta trang b mt php ton tch bin nh sau: x

1
= (i
1
, w
1
, j
1
), x
2
= ( i
2
, w
2
, j
2
) A
*

, nu

- 2 -
j
1
= i
2
th x
1
. x
2
= (i
1
, w
1
w
2
, j
2
), ngc li x
1
. x
2
= ; c bit, x A
*

, x. = .x = , x.e = e.x =
x. D thy A
*

lp thnh mt v nhm vi php ton tch bin c n v l e.

Ta gi A
*

l -v nhm c nh ngha bi A. Mt tp L A
*

c gi l mt ngn
ng m rng (-ngn ng) trn A. Nu khng s hiu nhm th ta cng s dng k hiu | x| l
di ca -t x, theo ngha | | = +, | e | = 0 v | x| = |w| nu x = (i, w, j). Cho X, Y A
*

, ta
gi thng tri (thng phi) ca X bi Y, k hiu Y
-1
X (t. X.

Y
-1
) l cc tp c xc nh
bi: Y
-1
X = { x A
*

| y Y : y.x X } v XY
-1
= { x A
*

| y Y : x.y X }. Hm
chiu Proj: A
*

A
*
{0}, 0A
*
, l hm c xc nh bi: Proj (e) = , Proj ( ) = 0 v
Proj (i, w, j) = w.
nh ngha 1. Cho M l mt v nhm bt k c phn t n v l 1, phn t zero l 0 v : A
*

M l mt nh x. Khi , c gi l -ng cu v nhm nu tha mn cc iu kin
sau:
(1) x, y A
*

m x.y th (x . y) = (x).(y)
(2) (e) = 1
(3) ( ) = 0
nh ngha 2. Cho L A
*

v v nhm M. Nu tn ti mt -ng cu v nhm : A

*

M sao
cho L =
-1
(N), vi N M th ta ni rng v nhm M tha L (hay L tha bi v nhm M).
T nh ngha 2, nu N
1
, N
2
M ta c
-1
(N
1
N
2
) =
-1
(N
1
)
-1
(N
2
),
-1
(N
1
N
2
) =

-1
(N
1
)
-1
(N
2
),
-1
(N
1
\ N
2
) =
-1
(N
1
)\
-1
(N
2
). Hn na, nu l ton nh th:

-1
(N
1
-1
N
2
) =
-1
(N
1
)
- 1

-1
(N
2
),
-1
(N
1
N
2
-1
) =
-1
(N
1
)
-1
(N
2
)
- 1
.
Vi mi -ngn ng L A
*

, p dng cch thc ca S. Eilenberg [9] ta c th xy

dng v nhm M tha L trn A
*

. K hiu (A,M) l tp tt c cc -ngn ng trn A

*

tha bi
M. Theo [8], th (A,M) ng vi cc php ton Boolean. Hn na, nu l ng cu th (A,M)
ng vi php ly thng tri v thng phi.
Mi quan h gia -on nhn c, -ngn ng chnh quy v -otomat c th
hin qua nh l sau:
nh l 1. ([7]) Cho L A
*

. Khi , cc iu kin sau y l tng ng:

(i) L l -on nhn c bi mt -otomat a nh hu hn.
(ii) L tha bi mt v nhm hu hn.
(iii) L -on nhn c bi mt -otomat n nh hu hn.
(iv) L l -ngn ng chnh quy.
3. BI TON PCP V NG DNG
c rt nhiu tip cn ti bi ton PCP (bi ton tng ng Post) c trnh by trong cc
cng trnh khoa hc khc nhau. Sau y chng ti trnh by tm lc bi ton PCP, t
xut bi ton PCP theo tip cn ca t nh bin v -otomat nhm lm ni bt tnh kh dng
ca t nh bin trong cc h mt m.
Bi ton PCP: Cho bng ch hu hn A v cc t
1
,
2
, ,
n
,
1
,
2
, ,
n
A
*
, n 1. Tm
cc dy ch s i
1
, i
2
, , i
l
, 1 i
j
n, j = 1,,l sao cho:

i
1

i
2

i
l
=
i
1

i
2

i
l


- 3 -
Bi ton quyt nh l c li gii hay khng c li gii.
V d 1. Cho A = {a, b} v hai dy = (a, ab, bba) , = (baa, aa, bb). y l mt tnh hung
ca bi ton tng ng Post. Nu ta ghp cc t th ba, th hai, th ba v th nht trong hai
danh sch cho, th trong c hai trng hp ta nhn c t bbaabbbaa.

1
= bba + ab + bba + a = bb + aa + bb + baa =
3

1

Khi dy ch s (3, 2, 3, 1) l mt li gii i vi tnh hung ny ca bi ton tng
ng Post.
Hn na, t dy ch s (3, 2, 3, 1), ta c dy lp (3, 2, 3, 1, 3, 2, 3, 1) cng l li gii
ca bi ton. Ngha l, nu tm c dy ch s (i
1
, i
2
, , i
l
) l li gii ca bi ton th ta cng s
tm c dy (i
1
, i
2
, , i
l
)
*
cng l li gii ca bi ton.
Mt khc, nu bi ton trn ch c hai dy dng
2
,
3
v
2
,
3
th bi ton s khng c
li gii, bi v s khng tm c cp c cng k t cui.
V d 2. Cho A = {a, b, c} v hai dy: = (bb, ab, c), = (b, ba, bc). Khi cc dy ch s
(1, 2, ..., 2, 3) v (1, 2, ..., 2, 3)
*
l li gii ca bi ton
V tnh quyt nh ca bi ton trn, ta c kt qu:
nh l 2. ([11]) Bi ton tng ng Post l khng quyt nh c.
Trong phn tip theo, chng ti s trnh by mt dng m rng khc ca otomat a nh
hu hn A v nu khng s hiu nhm th ta vn gi l -otomat a nh hu hn A

, vi tp
bin B khng ch l {0, 1}, m tp bin B c m rng thnh B {0
B
}, vi 0
B
l phn t
zero ca na nhm B v php ton trn B c xc nh b mt theo h mt. Tip n, ta s s
dng -otomat a nh hu hn A

ng dng vo bi ton tng ng Post nhm xy dng

h mt mi, m bo tnh bo mt cao.
Cho B l mt na nhm, ta xy dng cu trc iu khin B (bng nhn BB) nh sau:
vi i, j, l, k B,
B B j L
i 0
B

k 0
B


c bit: i B, i . 0
B
= 0
B
. i = 0
B
.
Bng nhn BB phn ln cha cc phn t 0
B
. Thng thng, tng thm tnh bo
mt th B c s phn t rt ln khng th d dng tm c cu trc ca B.

- 4 -
V d 3. Cho w l t tuyt mt, gi s w =
7
.
3
.
2
.
9
=
7
.
3
.
2
.
9
.

Hnh 1. Cu trc t tuyt mt w
Vi t w (Hnh 1), ta c cc im ct v lu tr chng di dng bng (cu trc bng nhn ca
na nhm b mt B) nh sau:
BB 1 2 3 4 5 6 7 8 9 ...
1 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

2 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

3 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

4 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

5 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

6 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

7 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

8 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

9 0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

.
.
.
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B
0
B

Chn M l mt v nhm rt ln. M c cha phn t n v l 1
M
, phn t zero l 0
M
. T
bng nhn ca B, ta xy dng v nhm M

c iu khin bi na nhm B nh sau: vi (i

1
, m
1
,
j
1
), (i
2
, m
2
, j
2
) M

.



Ta c Card(M

) = Card(B
2
) . Card(M). T ng cu v nhm : A
*
M, ta c th xc
nh ng cu

: A
*

nh sau:
(1). a A, (i, a, j) (i, (a), j),
(2). (i, , j) (i, 1
M
, j),
(3) e e

,
(4) .
(i
1
, m
1
, j
1
).(i
2
, m
2
, j
2
) =
(i
1
, m
1
m
2
, j
2
) Nu j
1
. i
2
0
B


Nu j
1
. i
2
= 0
B


- 5 -
Vi M

c xy dng nh trn v mt kha b mt K = (i , m

*
, j
*
), ta xy dng -otomat
A

(K) = (A

, Q

, I

, T

), vi tp cc trng thi Q

= M

, tp cc trng thi khi u I

, I

= (i, 1
M
, i), i B, tp cc trng thi kt thc T

= K v hm chuyn

c xc nh bi:
vi mi trng thi (i, m, j) M

v -t (k, w, l) A
*

th




Ta k hiu (i, m, j )
) , , ( l w k
(i , m.(w), l ) nu i . k 0
B
.
Ly K = (i, m
*
, j
*
) M

v phn t khi u (i, 1

M
, i ), i B. Khi , ta gi w A
*
l mt
t hp l v ng i c nhn w l ng i thnh cng nu tn ti dy:
(i
1
, a
1
, j
1
), (i
2
, a
2
, j
2
), . . . , (i
l
, a
l
, j
l
)
v ng i
(i , 1
M
, i )
) , , ( . . . ) , , ).( , , (
2 2 2 1 1 1 l l l
i a i i a i i a i
K
vi i
1
= i , i
l
= j
*
, a
1
a
2
... a
l
= w v (w) = m
*
.
Vi bng nhn b mt ca B c c l Card(B
2
) nh trn. Nu thc hin tn cng theo kiu
vt cn tm cu trc ca B th thut ton c phc tp thi gian O(Card(B
2
)
Card(B)
). Lu
rng trong s bo mt th hm c th thay i theo thi gian nhm m bo tnh b mt. V
nhm M c th cng khai hoc c th l mt nhm php th. Vi mi t w, c th c nhiu cch
chia cc im ct khc nhau. Ni chung ngi/c quan chng thc (CA) phi bit cch chia ny.
Sau y ta xem xt mt dn xut ca bi ton tng ng Post cho lp ngn ng t nh
bin.
Cho bng ch hu hn A, cc t a
1
, a
2
, ..., a
n
A
*
, kha K = (i, m
*
, j
*
) v bng nhn b mt
B. Tm cc dy ch s i
1
, i
2
, ..., i
l
, n i
j
l, j = 1,,l sao cho:
w = a
i
1
. a
i
2
... a
i
l
v (i
1
, (w), i
l
) = K, vi : A
*
M l mt ng cu v nhm.
Ngha l, tm dy i
1
, i
2
, ..., i
l
sao cho i
1
= i , i
l
= j
*
, (a
1
a
2
... a
l
) = m
*
.
Tip theo, ta biu din bi ton trn my tnh v nh gi phc tp ca thut ton tm li
gii cho bi ton ny.
T dy w = a
i
1
, a
i
2
, ..., a
i
l
, ta m rng thnh dy (i
1
, a
i
1
, i
1
), (i
2
, a
i
2
, i
2
), . . . , (i
l
, a
i
l
, i
l
) v lu
tr trong b nh di dng {(i
1
, a
i
1
), (i
2
, a
i
2
), . . . , (i
l
, a
i
l
)}. i vi kha K = (i, m
*
, j
*
), ta lu
tr dy ch s kha (i
1
.i
2
, i
2
.i
3
, . . . , i
l-1
.i
l
), vi i
1
= i , i
l
= j
*
, (w) = m
*
. Trong s bo mt, ta
cn gi b mt chui w v dy ch s i
1
, i
2
, ..., i
l
. Hm c th cng khai hoc gi b mt.

((i , m, j), (k, w, l)) =

(i , m.(w), l) Nu i . k 0
B


0
B
Nu i . k = 0
B



- 6 -
Sau y, ta nh gi phc tp ca thut ton vt cn tn cng vo s bo mt tm
mt li gii hp l.
t p = |w|. Khi , kch thc ca na nhm B l tp tt c cc khc con ca { w + 0
B
+
(0
B
) }, ngha l
Card(B) = p + (p-1) + (p-2) + . . . + 1 + 1 + 1 = 2
2
). 1 (
+
+ p p

S phn t khc 0
B
trong na nhm B l cc phn t c di 2 tr i, do :
Card(B)
0
B
= (p-1) + (p-2) + . . . + 1 =
2
) 1 .( p p

V vy, bng nhn ca B c s phn t l:
Card(BB) =
2
2
2
). 1 (

+
+ p p

T s phn t khc 0
B
v tng s phn t ca bng nhn B l:
2 2 2
2
2
. ) 1 (
) 1 .(
2
2
). 1 (
2
) 1 .(
2
p p p
p p
p p
p p

+
+

Dy hp l cn tm l:
i = i
1
, i
2
, . . . , i
l-1
, i
l
= j
*
v i
1
.i
2
0
B
, i
2
.i
3
0
B
, . . . , i
l-1
.i
l
0
B
.
Khi thut ton vt cn tm dy hp l trn c phc tp thi gian c:
Card(B
l-2
) =
2
2
). 1 (

+
l
p p

Ta cn xem xt phc tp thi gian ca thut ton tn cng vo s bo mt theo
phng php tn cng xc sut nh sau:
t q = |w
q
|. Khi l -1 q p-2. Ta c xw
q
y = w, vi x, y (Hnh 2). Vy c
2
1

l
q
C cch
chia cc dy khc con ly ra dy i
2
, i
3
, ... , i
l-1
.
+ Vi |x| = 1, |y| = 1 v q c nh, th s cch ly w
q
l:
p 1 q = p 1 (q 2) = 1
+ Vi q ty , th s cch ly w
q
l:
2
1

l
q
C

- 7 -
x
w
q
w
y
i
l
= j
*
i = i
1

Hnh 2. Chi tit cu trc t tuyt mt w

Vy, xc sut thng li P tm dy i = i
1
, i
2
, ... , i
l-1
, i
l
= j
*
l:
P
) 2 .( 2
2
1
2
) 2 ( 2
2
1
2
2
2
1
. 2
. ) 1 (
. 2
2
). 1 (

+
=

l
l
q
l
l l
l
q
l
l
l
q
p
C
p p
C
p p
C

p l l C
p
C
l
q l
l
q
l
2 2
2
1 2 ) 2 .( 2
2
1
2
2
log ) 2 .( 4 2 log ). 2 .( 2 log
. 2
log +

p l l
l
l q q q
2 2 2
log ) 2 .( 4 2 log ). 2 .( 2
) 2 ( ... 3 . 2 . 1
) 2 ( ... ) 2 ).( 1 (
log +

+

p l l
l l q q q
2 2
2 2 2 2 2 2
log ) 2 .( 4 2 log ). 2 .( 2
) 2 ( log ... 2 log 1 log ) 2 ( log ... ) 2 ( log ) 1 ( log
+
+ + + +

Vi cc gi tr l, p, q c th, ta c P tng ng cho trong Bng 1.

TT l p q T l ( xp x)
1 8 80 16 1 / 2
127

2 10 128 32 1 / 2
185

3 10 128 16 1 / 2
195

4 12 320 52 1 / 2
279

5 12 320 32 1 / 2
287
6 12 512 100 1 / 2
296
7 16 512 32 1 / 2
314
8 16 1024 32 1 / 2
504
9 16 2048 32 1 / 2
560
Bng 1. Bng k xc sut tm c nghim ca bi ton

- 8 -
Nhn xt 1. T bng nh gi kt qu trn, ta thy rng kh nng tn cng thnh cng s
bo mt bng phng php vn cn l rt nh. S bo mt trn c th c s dng gii
quyt mt s bi ton thc tin nh xc thc ngi dng.
V d 4. Cho cc d kin:
Mi ngi dng c h thng xc thc CA cung cp mt dy t m {
1
,
2
, ,
n
},
i

A
*
. H thng CA lu tr b thng tin:
{ K
CA
= (i , w, j
*
) M

; BB ; K ;

},
trong , K
CA
l t kha b mt ca CA; BB l bng nhn b mt; K = {K
C
, K
D
, K
E
, ...} l tp
kha ca cc ngi dng v : A
*
K
C
A
*
l mt ng cu m.
Bi ton xc thc ngi dng c pht biu nh sau: Cho bit ngi dng C bt k c
phi l ngi dng hp php hay khng?
tr li cu hi trn, ng dng s bo mt xy dng, ta xut s xc thc sau:
S 1. Xc thc ngi dng.
B
1
. H thng yu cu ngi dng C cung cp dy t m {
1
,
2
, ,
n
}.
B
2
. Tm dy t m {
1
,
2
, ,
n
}, vi
i

= (
i
,

K
C
).
B
3
. Kim tra, nu i = i
1
, j
*
= i
l
v
i
1
.
i
2

i
l
(A

(K
CA
)) th kt lun ngi dng C
l hp php, ngc li kt lun C l khng hp php.
Trong S 1, ng cu b mt : A
*
K A
*
c th l php XOR hoc php ton ng
d modulo P.




Nhn xt 2. Vi S 1 xc thc ngi dng, nu k gian D mun tn cng h thng th D
phi gi dng mt ngi dng hp php khc (gi s ngi dng C), khi D gii bi ton
tng ng Post. Tc l, vi hai dy t {
1
,
2
, ,
n
} v {
1
,
2
, ,
n
} tng ng ca D v C,
th D phi tm dy ch s {i
1
, i
2
, , i
k
} sao cho:
(
i
1
,

K
D
).(
i
2
,

K
D
) . . . (
i
l
,

K
D
) = (
i
1
,

K
C
).(
i
2
,

K
C
) . . . (
i
l
,

K
C
)
4. KT LUN
Trong bi bo chng ti a ra mt dng otomat mi c m rng t otomat thng thng
(-otomat). T , cho ta mt cch nhn mi v biu din thng tin theo m hnh ton hc ca
otomat v cc ng dng ca n. Ta cng xut bi ton tng ng Post cho lp ngn ng t
nh bin nhm to ra cc by ca sp cho php xy dng cc h mt c tnh b mt rt cao.

=
i


K
C

=
i
.

K
C
+ C mod P , vi (K
A
, P) l s nguyn t cng nhau

- 9 -
Ngoi ra, trong s cc kt qu nhn c c nhiu kha cnh c th pht trin tip c v mt l
thuyt v ng dng. Chng ti s tip tc pht trin m rng hng nghin cu ny trong cc
cng trnh sau.
TI LIU THAM KHO
[1] E. L. Post, A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc Vol. 52
(No. 4), 264-268 (1946).
[2] K. Ruohonen, On some variants of Post's correspondence problem. Acta Informatica
(Springer) Vol. 19 (No. 4), pp. 357-367 (1983).
[3] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-
Completeness. W. H. Freeman & Co. New York, NY, USA. pp. 228 (1979).
[4] Y. Gurevich, Average case completeness. J. Comp. Sys. Sci. (Elsevier Science) Vol. 42
(No. 3), pp. 346-398 (1991).
[5] V. Halava, M. Hirvensalo, R. de Wolf, Marked PCP is decidable. Theoretical Computer
Science, Vol. 255, pp. 193-204 (2001).
[6] P. Chambart, Ph. Schnoebelen, Post embedding problem is not primitive recursive, with
applications to channel systems. Lecture Notes in Computer Science, Vol. 4855, pp. 265-
276 (2007).
[7] H Ngc Vinh, Phan Trung Huy, Long Vn. -ngn ng chnh quy v m. Hi tho
khoa hc quc gia ln th IV Nghin cu c bn v ng dng Cng ngh thng tin
(FAIR 2009), H Ni, pp.13-22 (2009).
[8] H. N. Vinh, P. T. Huy, Codes of Bounded Words. Proceedings of the 3rd International
Conference on Computer and Electrical Engineering (ICCEE 2010), Vol. 2, pp. 89-95
(2010).
[9] S. Eilenberg, Automata, languages and machines. Vol. B, Academic Press, New York
(1976).
[10] Vu Thnh Nam, M da trn mt s loi tch mi. Lun n tin s Ton hc, Trng i
hc Bch Khoa H Ni (2007).
[11] A. Salomaa, Nhp mn tin hc l thuyt tnh ton v cc tmat (Bn dch). NXB Khoa
hc v K thut (1992).





- 10 -
ABSTRACT
On BOUNDED WORDS AND THE POST CORRESPONDENCE
PROBLEM
This paper contributes to the development of cryptography a method, which is used to
establish security schemata for languages of bounded words with the trapdoor based on the
Post Correspondence Problem.

Keywords: cryptography, post correspondence problem, security schema, bounded
word.





a ch:
(1)
Trng i hc S phm K thut Vinh
(2)
Trng i hc S phm K thut Hng Yn
(3)
Trng i hc Bch khoa H ni