A Fully Equational Proof of Parikh's Theorem

Forfattere

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

DOI:

https://doi.org/10.7146/brics.v8i28.21688

Resumé

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.

Downloads

Publiceret

2001-06-04

Citation/Eksport

Aceto, L., Ésik, Z., & Ingólfsdóttir, A. (2001). A Fully Equational Proof of Parikh’s Theorem. BRICS Report Series, 8(28). https://doi.org/10.7146/brics.v8i28.21688

Nummer

Nr. 28 (2001): RS-28 A Fully Equational Proof of Parikh's Theorem

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).