Efficient parallel recognition of context-free languages

Gibbons, 1988 Nijholt, 1989, Parallel parsing strategies in natural language processing, 240 Yonezawa, 1988, Object-oriented parallel parsing for context-free grammars, 773 Wang, 1992, Constant time algorithms for transitive closure and some related graph problems on Processor Arrays with Reconfigurable Bus System, IEEE Trans. Parallel Distributed Syst., 1, 500, 10.1109/71.80177 Younger, 1965, Recognition and parsing of context-free languages in time n3, Inform. Control, 8, 607 Waltz, 1985, Massively parallel parsing: a strongly interactive model of natural language interpretation, Cognitive Sci., 9, 51, 10.1207/s15516709cog0901_4 Chen, 1992, On the parallel computation of algebraic path problem, IEEE Trans. Parallel Distributed Syst., 3, 251, 10.1109/71.127265 Earley, 1986, An efficient context-free parsing algorithm, 25 Aravenda, 1991, A class of low complexity high concurrence algorithms, IEEE Trans. Parallel Distributed Syst., 2, 495, 10.1109/71.97905 Chu, 1983, VLSI architecture for high-speed recognition of context-free languages, 10, 43 Valiant, 1975, General context-free recognition in less than cubic time, J. Comput. System Sci., 10, 308, 10.1016/S0022-0000(75)80046-8 Harrison, 1978 Tomita, 1986 Miller, 1988, Image computation on reconfigurable VLSI arrays, 935 Moll, 1988 Graham, 1980, An improved context-free recognizer, ACM-TOPLAS, 2, 415, 10.1145/357103.357112 Kosaraju, 1975, Speed of recognition of context-free languages by array automata, SIAM J. Comput., 4, 335, 10.1137/0204028 Kung, 1985, VLSI array processors, IEEE ASSP Mag., 4, 10.1109/MASSP.1985.1163741 Kung, 1987, Optimal systolic design for the transitive closure and the shirtest path problems, IEEE Trans. Comput., C-36, 603, 10.1109/TC.1987.1676945 Chen, 1990, Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting, IEEE Trans. Parallel Distributed Syst., 1, 241, 10.1109/71.80135