PARALLEL PARSING ON A ONE-WAY ARRAY OF FINITE-STATE MACHINES

被引：49

作者：

CHANG, JH

IBARRA, OH

PALIS, MA

机构：

[1] UNIV PENN, DEPT COMP & INFORMAT SCI, PHILADELPHIA, PA 19104 USA

[2] UNIV MINNESOTA, DEPT COMP SCI, MINNEAPOLIS, MN 55455 USA

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1987年 / 36卷 / 01期

关键词：

D O I：

10.1109/TC.1987.5009449

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：64 / 75

页数：12

共 17 条

[1]

Aho A.V., 1972, THEORY PARSING TRANS, V1

[2]

CHIANG Y, 1986, IEEE T PATTERN ANAL, V6, P302

[3]

CHU K, 1982, 9TH P ANN INT S COMP

[4] REAL-TIME COMPUTATION BY N-DIMENSIONAL ITERATIVE ARRAYS OF FINITE-STATE MACHINES [J].

COLE, SN .

IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (04) :349-&

[5]

Guibas L., 1979, P CALTECH C VLSI, P509

[6] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J].

HIRSCHBERG, DS .

JOURNAL OF THE ACM, 1977, 24 (04) :664-675

[7] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].

HIRSCHBERG, DS .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :341-343

[8]

IBARRA O, UNPUB J PARALLEL DIS

[9]

IBARRA O, UNPUB IEEE T ACOUST

[10] DESIGNING SYSTOLIC ALGORITHMS USING SEQUENTIAL-MACHINES [J].

IBARRA, OH ;

KIM, SM ;

PALIS, MA .

IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (06) :531-542

← 1 2 →