Codifiable Languages and the Parikh Matrix Mapping (original) (raw)

J. Univers. Comput. Sci., 2001

Abstract

We introduce a couple of families of codifiable languages and investigate properties of these families as well as interrelationships between different families. Also we 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.

Adrian Atanasiu hasn't uploaded this paper.

Let Adrian know you want this paper to be uploaded.

Ask for this paper to be uploaded.