JUCS - Journal of Universal Computer Science 7(9): 783-793, doi: 10.3217/jucs-007-09-0783
Codifiable Languages and the Parikh Matrix Mapping
expand article infoAdrian Atanasiu‡, Carlos Martín-Vide§, Alexandru Mateescu‡
‡ Faculty of Mathematics, Bucharest University Academiei, Bucharest, Romania§ Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

Corresponding author: Adrian Atanasiu ( aadrian@pcnet.ro )

© Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu.
This article is freely available under the J.UCS Open Content License.
Citation: Atanasiu A, Martín-Vide C, Mateescu A (2001) Codifiable Languages and the Parikh Matrix Mapping. JUCS - Journal of Universal Computer Science 7(9): 783-793. https://doi.org/10.3217/jucs-007-09-0783
Open Access
Abstract
We introduce a couple of families of codifiable languages and investigate properties of these families as well as interrelationships between diffeerent families. We also develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codifiable context-free language. Finally, an attributed grammar that computes the values of the Parikh matrix mapping is defined.
Keywords
the Parikh mapping, the Parikh matrix mapping, injectivity