A Fully Equational Proof of Parikh's Theorem

Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir


We show that the validity of Parikh's theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of mu-term equations of continuous commutative idempotent semirings.

Full Text:


DOI: http://dx.doi.org/10.7146/brics.v8i28.21688
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.

ISSN: 0909-0878 

Hosted by the Royal Danish Library and Aarhus University Library