AN O(N1.5) ALGORITHM TO DECIDE BOUNDEDNESS FOR CONFLICT-FREE VECTOR REPLACEMENT SYSTEMS

被引：19
作者：
HOWELL, RR
ROSIER, LE
YEN, HC
机构：
[1] Univ of Texas at Austin, Austin, TX,, USA, Univ of Texas at Austin, Austin, TX, USA
来源：
INFORMATION PROCESSING LETTERS | 1987年 / 25卷 / 01期
关键词：
D O I：
10.1016/0020-0190(87)90089-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
13
引用
收藏
页码：27 / 33
页数：7
相关论文
共 13 条
[1]  
Crespi-Reghizzi S., 1975, Information Processing Letters, V3, P78, DOI 10.1016/0020-0190(75)90020-4
[2]  
Hack M., 1974, P SWAT 1974, P156
[3]  
HUYNH D, 1985, 17TH P ANN ACM S THE, P405
[4]   COMPLEXITY OF THE WORD PROBLEM FOR COMMUTATIVE SEMIGROUPS OF FIXED DIMENSION [J].
HUYNH, DT .
ACTA INFORMATICA, 1985, 22 (04) :421-432
[5]  
Jones N. D., 1977, Theoretical Computer Science, V4, P277, DOI 10.1016/0304-3975(77)90014-7
[6]  
Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2
[7]  
Karp R. M., 1969, J COMP SYST SCI, V3, P147, DOI DOI 10.1016/S0022-0000(69)80011-5
[8]  
KELLER RM, 1972, 117 PRINC U COMP SCI
[9]   PROPERTIES OF CONFLICT-FREE AND PERSISTENT PETRI NETS [J].
LANDWEBER, LH ;
ROBERTSON, EL .
JOURNAL OF THE ACM, 1978, 25 (03) :352-364
[10]  
Lipton R., 1976, 62 YAL U DEP COMP SC
12