Research
A strengthening of the MCFL-ness of O_2
arXiv:2608.18813v1 Announce Type: cross Abstract: In the last years, a number of proofs of the fact that O_2 is a multiple context-free grammar (MCFG) were given. Such results can be exploited in the
arXiv:2608.18813v1 Announce Type: cross Abstract: In the last years, a number of proofs of the fact that O_2 is a multiple context-free grammar (MCFG) were given. Such results can be exploited in the fields of both computational linguistics and of computational algebra. Here, we focus on a recent such proof spelled in terms of factorizations of string tuples, and give a new result with a stronger characterization of such factorizations than in existing theorems.
Related
Source: arXiv cs.AI | 2026-08-20