Please use this identifier to cite or link to this item:
Title: Codifiable languages and the Parikh matrix mapping
Authors: Atanasiu, Adrian
Martin-Vide, Carlos
Mateescu, Alexandru
Keywords: Lingvistica computationala
Lingvistica matematica
Issue Date: 2010
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.
Appears in Collections:Articole ale cadrelor didactice / Articles of the teaching staff

Files in This Item:
File Description SizeFormat 
Codifiable_languages_p.pdf167.33 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.