generative power and closure properties of watson-crick grammars
Clicks: 154
ID: 191934
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
154 views
24 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #14 of 26 articles by views in journal of evidence-based complementary & alternative medicine
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties. We show that WK linear grammars can generate some context-sensitive languages. Moreover, we demonstrate that the family of WK regular languages is the proper subset of the family of WK linear languages, but it is not comparable with the family of linear languages. We also establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations.
| Reference Key |
zulkufli2016appliedgenerative
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Nurul Liyana Mohamad Zulkufli;Sherzod Turaev;Mohd Izzuddin Mohd Tamrin;Azeddine Messikh |
| Journal | journal of evidence-based complementary & alternative medicine |
| Year | 2016 |
| DOI |
10.1155/2016/9481971
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.