Showing papers in "Journal of Automata, Languages and Combinatorics in 1979"
•
71 citations
•
23 citations
•
17 citations
•
8 citations
•
7 citations
•
6 citations
•
6 citations
•
6 citations
•
TL;DR: It is shown that if the transformation is applied to a strict deterministic grammar, the newly obtained grammar in Greibach normal form is also strict Deterministic.
Abstract: A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal form. It is shown that if the transformation is applied to a strict deterministic grammar, the newly obtained grammar in Greibach normal form is also strict deterministic.
5 citations
•
•
•
•
•
•
•
•
•
•
•
••
TL;DR: Fast parallel matrix multiplication algorithms in SIMD and MIMD modes are described for implementation in a parallel-binary matrix processing system with facilities for bit-wise parallel Boolean operation and power-of-two shifts on Boolean matrices.
Abstract: : Fast parallel matrix multiplication algorithms in SIMD (Single-Instruction-Multiple-Data) and MIMD (MUltiple-Instruction-Multiple-data) modes are described for implementation in a parallel-binary matrix processing system with facilities for bit-wise parallel Boolean operation and power-of-two shifts on Boolean matrices. A comparative study of these algorithms is made on the basis of their relative time-complexities, when conventional binary and prime-modulus arithmetic are used for forming the matrix product. (Author)