May 29, 2009 · 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 ...
The model of parallel computation is a one-way linear array of identical finite-state machines. The data movement in the array is one-way, from left to right.
Parallel Parsing on a One-Way Array of Finite-State Machines - IEEE Xplore
ieeexplore.ieee.org › iel5
The 2-DIA, being finite-state and one-way, is not so easy to outputs $ after at most S(n) sweeps. Clearly, S(n) . n + 1. program. Concurrency and ...
It is shown that a one-way two-dimensional iterative array of finite-state machines can recognize and parse strings of any context-free language in linear ...
The model of parallel computation is a one-way linear array of identical finite-state machines. The data movement in the array is one-way, from left to right.
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 ...
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 ...
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 ...
Efficient parallel algorithms for some parsing problems are presented. These problems include the parsing of linear context-free.
We show that a one-way two-dimensional iterative However, the array implementation of the parsing algorithm array of finite-state machines (2-DIA) can ...