Some results about centralized PC grammar systems

AbstractIn this note, we bring to evidence some techniques that can be performed on PC grammar systems working with linear grammars. This allows us to show that the generative power of (centralized) PC grammar systems working with right-linear grammars is bigger than expected, and to prove closure properties of the families of languages generated by centralized PC grammar systems working with (right-)linear grammars, such as the closure under union and the closure under intersection with a rational set, and for centralized PC grammar systems working with right-linear grammars, the closure under product