Watson-crick context-free grammars: Grammar simplifications and a parsing algorithm

Nurul Liyana Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, Azeddine Messikh

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


A Watson-Crick (WK) context-free grammar, a context-free grammar with productions whose right-hand sides contain nonterminals and double-stranded terminal strings, generates complete double-stranded strings under Watson-Crick complementarity. In this paper, we investigate the simplification processes of Watson-Crick context-free grammars, which lead to defining Chomskylike normal form for Watson-Crick context-free grammars. The main result of the paper is a modified CYK (Cocke-Younger-Kasami) algorithm for Watson-Crick context-free grammars in WK-Chomsky normal form, allowing to parse double-stranded strings in O(n6) time.

Original languageEnglish
Pages (from-to)1361-1373
Number of pages13
JournalComputer Journal
Issue number9
Publication statusPublished - Sept 1 2018
Externally publishedYes


  • Context-free grammars
  • DNA computing
  • Formal languages
  • Grammar simplifications
  • Parsing algorithms
  • Watson-Crick automata
  • Watson-Crick grammars

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Watson-crick context-free grammars: Grammar simplifications and a parsing algorithm'. Together they form a unique fingerprint.

Cite this