Article contents
A Fully Equational Proof of Parikh's Theorem
Published online by Cambridge University Press: 15 December 2002
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.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 2: Fixed Points in Computer Science (FICS'01) , April 2002 , pp. 129 - 153
- Copyright
- © EDP Sciences, 2002
References
- 6
- Cited by