Introduction | Most of the literature has been focusing on binarization algorithms, which attempt to find a reduction to 7“ = 2 and return a failure if this is not possible. |
Introduction | (2009) report a general binarization algorithm for LCFRS which, in the case of f = 2, works in time 0(lpl7), where |p| is the size of the input production. |
Introduction | A more efficient binarization algorithm for the case f = 2 is presented in (Gomez-Rodriguez and Satta, 2009), working in time O(|p|). |