... can also be used for finding binarizations for LCFRS with fan-out larger than two, again without increasing the fan-out However, it seems unlikely that this can still be done in linear time, since ... this, when a binarization with fan-out ≤ does not exist the algorithm will still provide us with a list of reductions that can be converted into a set of productions equivalent to p with fan-out at ... of strings, defining the language of G Linear context-free rewriting systems We briefly summarize here the terminology and notation that we adopt for LCFRS; for detailed definitions, see (Vijay-Shanker...