Abstract
Purchase PDF (219 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (709 K)
doi:10.1016/j.ipl.2007.09.002 
Copyright © 2007 Elsevier B.V. All rights reserved.
Received 5 June 2007;
revised 3 September 2007;
accepted 3 September 2007.
Communicated by L. Boasson.
Available online 11 September 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Keywords: Formal languages; Picture languages; 2D languages; Context-free picture grammars; CKY parsing; Kolam Array grammars; Matrix grammars; Siromoney grammars
