Designing systolic algorithms using sequential machines
IEEE Transactions on Computers - The MIT Press scientific computation series
The String-to-String Correction Problem
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
VLSI architectures for high speed recognition of context-free languages and finite-state languages
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Parallel Recognition and Parsing on the Hypercube
IEEE Transactions on Computers
String Editing on a One-Way Linear Array of Finite-State Machines
IEEE Transactions on Computers
A bibliography on parallel parsing
ACM SIGPLAN Notices
Accelerating the CKY Parsing Using FPGAs
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Iterative Arrays with Small Time Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Iterative Arrays with a Wee Bit Alternation
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
A parallel LCS algorithm for biosequences alignment
Proceedings of the 2nd international conference on Scalable information systems
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science
Fast sequence similarity computing with LCS on LARPBS
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Fast scalable algorithm on LARPBS for sequence alignment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Fast iterative arrays with restricted inter-cell communication: constructions and decidability
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Fast parallel algorithms for the longest common subsequence problem using an optical bus
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 14.99 |
We show that a one-way two-dimensional iterative array of finite-state machines (2-DIA) can recognize and parse strings of any context-free language in linear time. What makes this result interesting and rather surprising is the fact that each processor of the array holds only a fixed amount of information (independent of the size of the input) and communicates with its neighbors in only one direction. This makes for a simple VLSI implementation. Although it is known that recognition can be done on a 2-DIA, previous parsing algorithms require the processors to have unbounded memory, even when the communication is two-way. We also consider the problem of finding approximate patterns in strings, the string-to-string correction problem, and the longest common subsequence problem, and show that they can be solved in linear time on a 2-DIA.