Вы находитесь на странице: 1из 12

1

. .,

natashamilkova@yandex.ru
. .,
. .
dudnikov.vladislav@gmail.com

-
,
. -
, ,
.
,
4 5

.

: , , -
, , , -
.

1.

-
,
-
.
, .
-
. -
-
() -
( -
#), , ,
. ( -

). [1, 2, 3, 4].

,
-
. [5],
1 . . , . . , 2015

44
8 10. -
[6].
( - )
, -
[7].
(
)

, ,
. , ,
, ,
- . -
. [7].

2.

-
. [5] [8, 9, 10, 11]
., [5] .
.
# Q Q , -
e X Q
A Q L
fR
L L, -
:
( )( )
A # X uv L u Lin e
L
(A) , v R
L in (X) .
fR
L

[9] # -
. 1 .

?


1

 A
a  Ab
  A

  b AU


  
3 2
   
b   I
a, b
? ?
. 1

. 1,
. 2.
.
A B
.

45
a b a b
1 3 2 A B C
3 1, 3 B D
2 2 2 C C C
1, 3 3 1, 2, 3 D B E
1, 2, 3 2, 3 1, 2, 3 E F E
2, 3 2 1, 2, 3 F C E
. 1 . 2

A . B a- -
, (.. -
).
D B.
, . 3,
C, E F .

e
L a b
A 1 B C
B 3 D
C 1, 2, 3 C C
D 1, 3 B C
. 3

e . 2, (L)
L e R
. 3.

 
  
  
- A a - B -  A  a
B 

   
  
6 6 6
b a b b a b

? 
? 
  ?

 
b b
C  D C - D

   
  
a, b   a, b  
? ? 6 6
. 2 . 3

e R 4:
(L)

e R
(L) a b
A
B A, D
C C A, C, D
D B
. 4

46
, 5, 6.

a b fR
L a b
B, C, D A, C, D A, B, C, D X Y Z
A, C, D C A, B, C, D Y U Z
A, B, C, D A, C, D A, B, C, D Z Y Z
C C A, C, D U U Y
. 5 . 6

6
. 6 -
fR :
L

  
- X a - Y -

 
b  
> 6
 
b
  b a

 ?=  a 
 ?
  
Z U
 
 

b  Ia
?
. 4
5 6 #. -
- ,
.

# X Y Z U
A # #
B # #
C # # # #
D # # #
. 7

P Q
R Q :

(A P ) (X R) (A#X),

B = (P, R) -.
- - B = (P, R):
( )
A Q \ P , (P {A}), R -
;
( )
X Q \ R , P, (R {X}) -
,

47
B .
# -
L# = (Q , # , # , {s }, F ),
{ }

F = f Q f #s ;
{ }

# = aXA A Q , X Q ;
{
{A2 }, A1 #X
# (A1 , a A2 )= .
X ,

# -
.

3. #

, () -
#. 2 3 . 8.
0 1 (. 9).

X Y Z X Y Z
A # # A 1 1 0
B # # B 1 0 1
. 8 . 9

#:

L# a A
a B
a A
a B
a A
a B
X X Y Y Z Z

A A B A B
B A B A B
. 10

aA
= a, a B
= b, a A
= c, a B
= d, aB
= e, a A
=f.
X X Y Y X Y

. 5:

L# a b c d e f
A A B A B
B A B A B
. 11

48

 

 b, d- 
A  B
 
c a, e  
I
a, b, f
6 ?

. 5

# -
:

1) ; ;

2) 0;
0.

, , 0 1
,
( , [10]).
(1),(2) . -
n 2m 1, n (
#) m ( #)
Le ( (L)
e R m )
(L) fR .
e R , L

[12] , (..
n = m) D(n) n-
[13]. ,
, #.
, -
/ -
. (-
) -
, (m)
(n).

4.

, -
(-),
-
. , -
-
. ,
- - -
[14].

49
- -
, -
. - -
,
; -
.
- , -
(1),(2)
. #
, ..
.
,
, -
. ,
,
-
, -
# . 12.
( -
).
, , , -
. 12.

A B ... X Y Z
A ... # #
B ... # #
... ... ... ... ... ... ...
X # # ...
Y # ...
Z # ...
. 12

(-
e (. .
L)
# L e -
fR
L ).
: -
, #, .
. -
1 ( -
1 ). -
( -
). 1
, 1, .
,
.
, . -
.

50
1 2 3 4 5
1 1 0 0 0 0
2 1 1 0 0 1
3 0 0 1 0 1
4 0 0 0 1 1
. 13

1 2 3 4 5
2 1 1 0 0 1
3 0 0 1 0 1
4 0 0 0 1 1
1 1 0 0 0 0
. 14

1, ..
, . 4- ( -
) 1 4- 5-. 5-
1 , 4-, ,
.

5 4 1 2 3
2 1 0 1 1 0
3 1 0 0 0 1
4 1 1 0 0 0
1 0 0 1 0 0
. 15

3- 2- .

5 1 2 3 4
2 1 1 1 0 0
3 1 0 0 1 0
4 1 0 0 0 1
1 0 1 0 0 0
. 16


-
:

1.
. .
. .
1. 1, i = n.

51
2. 1
i- , i--.
3. i > 0, 2,
.

,
1 , -
-
.
:

2.
. n m.
. D.
1. A (1) (2).
2. 1.
3. A D, 1,
A D.
4. (1) (2)
, , 1.

D
, .
. , -
4 5 335160 ,
, , 424.
,
.
D (-
) (
) n!m! . -
D . ,
n!m! ,
( - 810 -
) .

5.

. ,
, -
1, (-
). , , -
,
, .
-
, , , [3].
, ,

52
1, 1. -
, 1
: , , 1000 0011,
.
.
, -
, :
1. .
1, ,
1. 1 ,
, -
. ,
.
1, . ,
, .
, ,
-
.
,
. -
.
-
:

3.
. n m,
t.
. D.
1. A* t.
2. t
Ai A*.
3. Ai D, 1,
Ai D.
4. ,
, 1.

, -
.
- 8 10,
-
.

6. .

2 3 . 9.
3 4 ,
, 10 :

53
1 1 0 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 0 0
1 0 0 1 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 1
0 1 1 0 0 1 0 0 1 0 1 0 0 1 1 0 0 0 1 0

1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 0 0
1 0 0 1 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1
1 1 0 0 1 0 1 0 1 0 0 0 1 0 1 1 1 0 1 0
. 18

4 5 168.
# -
- . -
8 10.
-
. ,
, -
- .


[1] ., . . .: . 1977.

[2] ., . -
. .: . 1982.

[3] Hromkovihc J. Algorithmics for Hard Problems. Introduction to Com-


binatorial Optimization, Randomization, Approximation, and Heuristics.
Springer. 2004.
[4] Klarreich E. Landmark Algorithm Breaks 30-Year Impasse. URL:
http://www.wired.com/2015/12/landmark-algorithm-breaks-30-year-
impasse/?mbid=social_fb

[5] . ., . .
- //
. 2015. . 11. No. 1. C. 6576.
[6] Kameda T., Weiner P. On the state minimization of nondeterministic nite
automata // IEEE Trans. on Comp. 1970. Vol. 19. No. 7. P. 617627.

[7] . ., . . -
-
// . 2014. Vol 1.
No. 4. C. 2445.

[8] Melnikov B., Melnikova A. Some properties of the basis nite automaton //
The Korean Journal of Computational and Applied Mathematics. 2002. Vol. 9.
. 1. P. 131150.

54
[9] Melnikov B. Once more on the edge-minimization of nondeterministic nite
automata and the connected problems // Fundamenta Informaticae. 2010.
Vol 104. No. 3. P. 267283.

[10] Melnikov B., Melnikova A. Some more on the basis nite automaton // Acta
Informatica, Univ. Sapientiae. 2013. Vol. 5. . 2 P. 227244.

[11] . . . :
- . 2009.

[12] Lombardy S., Sakarovitch J. The universal automaton // Logic and


Automata. Amsterdam University Press. 2008. P. 457504.

[13] Dedekind R. Uber Zerlegungen von Zahlen durch ihre groten gemeinsamen
Teiler // Gesammelte Werke 2. Braunschweig. 1897. P. 103148.

[14] Gross J. L., Yellen J., Zhang P. (Eds.) Handbook of Graph Theory //
Discrete Mathematics and Its Applications. Vol. 25. 2003.

55