Search

Your search keyword '"Rahman, Aqilahfarhana Abdul"' showing total 5 results
Start Over Author "Rahman, Aqilahfarhana Abdul"
5 results on '"Rahman, Aqilahfarhana Abdul"'

1. Simplification process of static Watson-Crick context-free grammars.

Author

Fong, Wan Heng, Rahman, Aqilahfarhana Abdul, Sarmin, Nor Haniza, and Turaev, Sherzod

Subjects
*FORMAL languages, *PHILOSOPHY of language, *GRAMMAR, *STICKERS, *LANGUAGE & languages
Abstract

In formal language theory, a grammar is a set of production rules that describes the possible strings in a given language. Context-free grammars, the most applicable type of the grammars, may contain production rules that do not generate any string of the language or affect the string generation processes using several unnecessary steps. Thus, the elimination of such undesirable productions is important for the optimization of the string generation processes. The "cleaning" of context-free grammars is done through the simplification process consisting of a useful substitution rule, removal of useless productions, removal of λ − productions, and removal of unit-productions. This paper presents the simplification of static Watson-Crick context-free grammars; the grammatical counterparts of sticker systems that generate double-stranded strings using context-free rules, several transformations, and substitutions. The simplification process of static Watson-Crick context-free grammars is similar to the simplification process of arbitrary context-free grammars and Watson-Crick context-free grammars. This research shows that for every static Watson-Crick context-free language, there exists an equivalent static Watson-Crick context-free grammar without useless productions, λ − productions, and unit-productions. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

5. Static Watson-Crick Linear Grammars and Its Computational Power.

Author

Rahman, Aqilahfarhana Abdul, Wan Heng Fong, Sarmin, Nor Haniza, Turaev, Sherzod, and Zulkufli, Nurul Liyana Mohamad

Subjects
*GRAMMAR, *FORMAL languages, *LANGUAGE & languages
Abstract

DNA computing, or more generally, molecular computing, is a recent development on computations using biologicalmolecules, instead of the traditional silicon- chips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal language theory. The operations of DNA molecules inspire various types of formal language tools which include sticker systems, grammars and automata. Recently, the grammar counterparts of Watson-Crick automata known as Watson-Crick grammars which consist of regular, linear and context-free grammars, are defined as grammar models that generate double- stranded strings using the important feature of Watson-Crick complementarity rule. In this research, a new variant of static Watson-Crick linear grammar is introduced as an extension of static Watson-Crick regular grammar. A static Watson-Crick linear grammar is a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar. There is a difference in generating double-stranded strings between a dynamic Watson-Crick linear grammar and a static Watson-Crick linear grammar. A dynamic Watson-Crick linear grammar produces each stranded string independently and only check for the Watson-Crick complementarity of a generated complete double-stranded string at the end; while the static Watson-Crick linear grammar generates both stranded strings dependently, i.e., checking for theWatson- Crick complementarity for each complete substring. The main result of the paper is to determine some computational properties of static Watson-Crick linear grammars. Next, the hierarchy between static Watson-Crick languages, Watson-Crick languages, Chomsky languages and families of languages generated by sticker systems are presented. [ABSTRACT FROM AUTHOR]

Published
2019

Catalog

Books, media, physical & digital resources
See catalog results