LINEAR-TIME ONLINE RECOGNITION ALGORITHM FOR PALSTAR

被引:18
作者
GALIL, Z [1 ]
SEIFERAS, J [1 ]
机构
[1] PENN STATE UNIV,UNIVERSITY PK,PA 16802
关键词
D O I
10.1145/322047.322056
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:102 / 111
页数:10
相关论文
共 12 条
[1]   TIME AND TAPE COMPLEXITY OF PUSHDOWN AUTOMATON LANGUAGES [J].
AHO, AV ;
HOPCROFT, JE ;
ULLMAN, JD .
INFORMATION AND CONTROL, 1968, 13 (03) :186-&
[2]  
AHO AV, 1974, DESIGN ANALYSIS COMP
[3]  
Fischer M., 1974, COMPLEXITY COMPUTATI, VVII, P113
[4]   REAL-TIME SIMULATION OF MULTIHEAD TAPE UNITS [J].
FISCHER, PC ;
MEYER, AR .
JOURNAL OF THE ACM, 1972, 19 (04) :590-+
[5]  
GALIL Z, J COMPTR SYST SCI
[6]  
Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024
[7]  
KNUTH DE, 1971, AUTOMATA THEORY USEF
[8]   NEW LINEAR-TIME ONLINE ALGORITHM FOR FINDING SMALLEST INITIAL PALINDROME OF A STRING [J].
MANACHER, G .
JOURNAL OF THE ACM, 1975, 22 (03) :346-351
[9]  
SEIFERAS JI, MATH SYST THEORY
[10]  
SLISENKO AO, 1973, PROBLEMS CONSTRUCTIV, V6, P30