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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohamad Zulkufli, Nurul Liyana, Turaev, Sherzod, Mohd Tamrin, Mohd Izzuddin, Messikh Azeddine, Azeddine
Format: Article
Language:English
Published: Oxford Academic 2018
Subjects:
Online Access:http://irep.iium.edu.my/61503/
http://irep.iium.edu.my/61503/
http://irep.iium.edu.my/61503/
http://irep.iium.edu.my/61503/1/Watson%E2%80%93Crick%20Context-Free%20Grammars-%20Grammar%20Simpli%EF%AC%81cations%20and%20a%20Parsing%20Algorithm.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!