- The Parikh counting functions of sparse context-free languages are quasi-polynomials Flavio D'Alessandro Benedetto Intrigila Stefano Varricchio Sun 08 January 2023
- Complete Abstractions for Checking Language Inclusion Pierre Ganty Francesco Ranzato Pedro Valero Sun 24 October 2021
- Input-driven languages are in log n depth Patrick W. Dymond Sat 15 July 2017
Library Size: 13G (3 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
