A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mengel, Stefan, Vinall-Smeeth, Harry
Format:	Preprint
Published:	2024
Subjects:	Databases Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2412.03199