$O_2$的MCFL性质的强化
A strengthening of the MCFL-ness of $O_2$
- Lancaster University（兰卡斯特大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文针对$O_2$是多重上下文无关文法（MCFG）的已有证明，基于字符串元组因式分解得出更强的刻画结果，可应用于计算语言学与计算代数领域。
AI中文摘要：
近年来已有多篇论文证明$O_2$是多重上下文无关文法（MCFG），这类结果可应用于计算语言学与计算代数领域。本文聚焦于近期利用字符串元组因式分解给出的证明，得出新结果，对这类因式分解的刻画比现有定理更强。
英文摘要：
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.
