Generative capacity of sticker systems with the presence of weights

QR Code

Generative capacity of sticker systems with the presence of weights

DNA computing involves computing models which use the recombination behavior of DNA molecules as computation devices. This idea was successfully applied by Adleman in his biological experiment in order to show the solvability of the Hamiltonian path problem for larger instances. In 1998, a DNA based...

Full description

Bibliographic Details
Main Authors:	Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English English
Published:	Science Society of Thailand under Royal Patronage 2017
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/53808/ http://irep.iium.edu.my/53808/1/53808_Generative%20capacity%20of%20sticker%20systems.pdf http://irep.iium.edu.my/53808/7/53808_Generative%20capacity%20of%20sticker%20systems_Scopus.pdf

Similar Items

The generative capacity of sticker systems with weights
by: Yee, Sian Gang, et al.
Published: (2014)

Weighted sticker system
by: Gan, Yee Siang, et al.
Published: (2012)

Variants of weighted sticker systems with different weighting spaces
by: Fong, Wan Heng, et al.
Published: (2014)

Variants of weighted sticker systems with different weighting spaces
by: Fong, Wan Heng, et al.
Published: (2017)

Some properties and variants of weighted sticker systems
by: Gan, Yee Siang, et al.
Published: (2013)

The generative power of weighted one-sided and regular sticker systems
by: Gan, Yee Siang, et al.
Published: (2014)

Probabilistic sticker systems
by: Selvarajoo, Mathuri, et al.
Published: (2013)

Probabilistic simple sticker systems
by: Selvarajoo, Mathuri, et al.
Published: (2017)

The generative capacity of weighted simple and semi-simple splicing systems
by: Fong, Wan Heng, et al.
Published: (2016)

Some properties of probabilistic one-sided sticker systems
by: Selvarajoo, Mathuri, et al.
Published: (2013)

Computational power of probabilistic bidirectional sticker system in DNA computing
by: Selvarajoo, Mathuri, et al.
Published: (2015)

Sticker systems over monoids
by: Mohd Sebry, Nurul Afidah, et al.
Published: (2012)

The properties of probabilistic simple regular sticker system
by: Selvarajoo, Mathuri, et al.
Published: (2015)

Probabilistic regular sticker system and its properties
by: Selvarajoo, Mathuri, et al.
Published: (2014)

The generative capacity of probabilistic splicing systems
by: Selvarajoo, Mathuri, et al.
Published: (2015)

Computational power of weighted splicing systems
by: Gan, Yee Siang, et al.
Published: (2014)

Some properties of probabilistic one-sided sticker systems
by: Selvarajoo, Mathuri, et al.
Published: (2014)

Weighted simple and semi-simple splicing systems
by: Gan, Yee Siang, et al.
Published: (2014)

Weighted splicing systems
by: Fong, Wan Heng, et al.
Published: (2014)

Weighted splicing systems
by: Turaev, Sherzod, et al.
Published: (2012)

Some characteristics on the generative power of weighted one-sided splicing systems
by: Yee, Sian Gang, et al.
Published: (2015)

Automata diagram for finite groups
by: Fong, Wan Heng, et al.
Published: (2013)

Automata representation for Abelian groups
by: Fong, Wan Heng, et al.
Published: (2013)

Geometrical representation of automata over some abelian groups
by: Gan, Yee Siang, et al.
Published: (2012)

Generating some finite groups using sequential insertion systems
by: Yosman, Ahmad Firdaus, et al.
Published: (2017)

Generating finite cyclic and dihedral groups using sequential insertion systems with interactions
by: Fong, Wan Heng, et al.
Published: (2017)

The generative capacity of weighted simple and semi-simple splicing systems
by: Fong, Wan Heng, et al.
Published: (2015)

Weighted one-sided splicing systems
by: Yee, Sian Gang, et al.
Published: (2014)

Some properties of probabilistic semi-simple splicing systems
by: Mathuri, S., et al.
Published: (2012)

Automata diagram for groups
by: Gan, Yee Siang, et al.
Published: (2013)

Permutation groups in automata diagrams
by: Gan, Yee Siang, et al.
Published: (2013)

Automata for subgroups
by: Fong, Wan Heng, et al.
Published: (2014)

Some characteristics of probabilistic one-sided splicing systems
by: Selvarajoo, Mathuri, et al.
Published: (2013)

Probabilistic semi-simple splicing system and its characteristics
by: Selvarajoo, Mathuri, et al.
Published: (2013)

Some properties of semi-simple splicing system over some permutation groups
by: Selvarajoo, Mathuri, et al.
Published: (2013)

Languages of watson-crick petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)

Structural properties of place-labeled Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)

k-Watson-Crick Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)

State machine of place-labelled petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2017)

Place-Labeled Petri Net Controlled Grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2016)