| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429188 | Information Processing Letters | 2008 | 5 Pages |
Abstract
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident with Matz's context-free picture grammars). We describe a new parsing algorithm, which extends the Cocke, Kasami and Younger's classical parsing technique for string languages and preserves the polynomial time complexity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
