A Fully Equational Proof of Parikh's Theorem
Luca Aceto
June 2001 |
Abstract:
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 -term equations of
continuous commutative idempotent semirings
Available as PostScript, PDF, DVI. |