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

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

Bibliographic Details
Main Authors: Mohamad Zulkufli, Nurul Liyana, Turaev, Sherzod, Mohd Tamrin, Mohd Izzuddin, Messikh Azeddine, Azeddine
Format: Article
Language:English
English
English
Published: Oxford Academic 2018
Subjects:
QA Mathematics
QA75 Electronic computers. Computer science
Online Access: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
http://irep.iium.edu.my/61503/7/61503_Watson-crick%20context-free%20grammars%20Grammar%20simplifications%20and%20a%20parsing%20algorithm_scopus.pdf
http://irep.iium.edu.my/61503/12/61503_Watson-crick%20context-free%20grammars%20Grammar%20simplifications%20and%20a%20parsing%20algorithm_WOS.pdf

Similar Items

Similar Items