A grammar in which all composition functions are both linear and regular is called a Linear Context-free Rewriting System (LCFRS), a subclass of the GCFGs with strictly less computational power than the GCFGs as a whole.
LCFRS is a strict subclass of the GCFGs with strictly less computational power than the GCFGs as a whole. A grammar in which all composition functions are both linear and regular is called a Linear Context-free Rewriting System (LCFRS).
A grammar in which all composition functions are both linear and regular is called a Linear Context-free Rewriting System (LCFRS). LCFRS is a strict subclass of the GCFGs with strictly less computational power than the GCFGs as a whole.
A grammar in which all composition functions are both linear and regular is called a Linear Context-free Rewriting System (LCFRS). LCFRS is a strict subclass of the GCFGs with strictly less computational power than the GCFGs as a whole.