Voir la notice de l'article provenant de la source Numdam
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.
@article{ITA_2002__36_2_129_0, author = {Aceto, Luca and \'Esik, Zolt\'an and Ing\'olfsd\'ottir, Anna}, title = {A fully equational proof of {Parikh's} theorem}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {129--153}, publisher = {EDP-Sciences}, volume = {36}, number = {2}, year = {2002}, doi = {10.1051/ita:2002007}, zbl = {1024.68070}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2002007/} }
TY - JOUR AU - Aceto, Luca AU - Ésik, Zoltán AU - Ingólfsdóttir, Anna TI - A fully equational proof of Parikh's theorem JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2002 SP - 129 EP - 153 VL - 36 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2002007/ DO - 10.1051/ita:2002007 LA - en ID - ITA_2002__36_2_129_0 ER -
%0 Journal Article %A Aceto, Luca %A Ésik, Zoltán %A Ingólfsdóttir, Anna %T A fully equational proof of Parikh's theorem %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2002 %P 129-153 %V 36 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2002007/ %R 10.1051/ita:2002007 %G en %F ITA_2002__36_2_129_0
Aceto, Luca; Ésik, Zoltán; Ingólfsdóttir, Anna. A fully equational proof of Parikh's theorem. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 2, pp. 129-153. doi: 10.1051/ita:2002007
Cité par Sources :