bibliographer - Stefano Varricchio

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

The Parikh counting functions of sparse context-free languages are quasi-polynomials Flavio D'Alessandro Benedetto Intrigila Stefano Varricchio [github]

Quasi-polynomials, linear Diophantine equations and semi-linear sets Flavio D'Alessandro Benedetto Intrigila Stefano Varricchio [github]

Learning Functions Represented as Multiplicity Automata Amos Beimel Francesco Bergadano Nader H. Bshouty Eyal Kushilevitz Stefano Varricchio [github]

On the decidability of the equivalence problem for partially commutative rational power series Stefano Varricchio [github]

Well quasi-orders and regular languages Aldo de Luca Stefano Varricchio [github]

Well Quasi-orders in Formal Language Theory Flavio D'Alessandro Stefano Varricchio [github]

Well quasi-orders and context-free grammars Flavio D'Alessandro Stefano Varricchio [github]

On the regularity of languages on a binary alphabet generated by copying systems Daniel P. Bovet Stefano Varricchio [github]

On well quasi-orders on languages Flavio D'Alessandro Stefano Varricchio [github]

On the separability of sparse context-free languages and of bounded rational relations Christian Choffrut Flavio D'Alessandro Stefano Varricchio [github]

Learning Behaviors of Automata from Multiplicity and Equivalence Queries Francesco Bergadano Stefano Varricchio [github]

Library Size: 13G (11 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]