cs.FL · 2026-08-20 · No. 90

Formal Languages and Automata Theory, 2026-08-20.

1 new papers in cs.FL. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    A strengthening of the MCFL-ness of $O_2$

    Marco B. Caminati

    cs.FL · cs.AI · cs.LO · math.LO

    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.

    arxiv.org/abs/2608.18813 · PDF

This edition is part of The Daily Abstract — cs.FL archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.