New variants of insertion and deletion systems in formal languages

In formal language theory, the operations of insertion and deletion are generalizations of the operations of concatenation and left/right quotients. The insertion operation interpolates one word in an arbitrary place within the other while the deletion operation extracts the word from an arbitrary p...

Full description

Saved in:

Bibliographic Details
Main Author:	Yosman, Ahmad Firdaus
Format:	Thesis
Language:	English
Published:	2017
Subjects:	QA Mathematics
Online Access:	http://eprints.utm.my/id/eprint/80862/1/AhmadFirdausYosmanMFS2017.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.80862
record_format	uketd_dc
spelling	my-utm-ep.808622019-07-24T00:08:13Z New variants of insertion and deletion systems in formal languages 2017-08 Yosman, Ahmad Firdaus QA Mathematics In formal language theory, the operations of insertion and deletion are generalizations of the operations of concatenation and left/right quotients. The insertion operation interpolates one word in an arbitrary place within the other while the deletion operation extracts the word from an arbitrary position of another word. Previously, insertion and deletion have been applied to model the recombinance of DNA and RNA molecules in DNA computing, where contexts were used to mimic the site of enzymatic activity. However, in this research, new systems are introduced by taking motivation from the atomic behaviour of chemical compounds during chemical bonding, in which the concept of a balanced arrangement is required for a successful bonding. Besides that, the relation between insertion and deletion systems and group theory are also shown. Here, insertion and deletion systems are constructed with bonds and also interactions; hence new variants of insertion and deletion systems are introduced. The first is bonded systems, which are introduced by defining systems with restrictions that work on the bonding alphabet. The other variant is systems with interactions, which are introduced by utilizing the binary operations of certain groups as the systems’ interactions. From this research, the generative power and closure properties of the newly introduced bonded systems are determined, and a language hierarchy is constructed. In addition, group generating insertion systems are introduced and illustrated using Cayley graphs. Therefore, this research introduced new variants of insertion and deletion systems that contribute to the advancement of DNA computing and also showcased their application in group theory. 2017-08 Thesis http://eprints.utm.my/id/eprint/80862/ http://eprints.utm.my/id/eprint/80862/1/AhmadFirdausYosmanMFS2017.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:124931 masters Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Yosman, Ahmad Firdaus New variants of insertion and deletion systems in formal languages
description	In formal language theory, the operations of insertion and deletion are generalizations of the operations of concatenation and left/right quotients. The insertion operation interpolates one word in an arbitrary place within the other while the deletion operation extracts the word from an arbitrary position of another word. Previously, insertion and deletion have been applied to model the recombinance of DNA and RNA molecules in DNA computing, where contexts were used to mimic the site of enzymatic activity. However, in this research, new systems are introduced by taking motivation from the atomic behaviour of chemical compounds during chemical bonding, in which the concept of a balanced arrangement is required for a successful bonding. Besides that, the relation between insertion and deletion systems and group theory are also shown. Here, insertion and deletion systems are constructed with bonds and also interactions; hence new variants of insertion and deletion systems are introduced. The first is bonded systems, which are introduced by defining systems with restrictions that work on the bonding alphabet. The other variant is systems with interactions, which are introduced by utilizing the binary operations of certain groups as the systems’ interactions. From this research, the generative power and closure properties of the newly introduced bonded systems are determined, and a language hierarchy is constructed. In addition, group generating insertion systems are introduced and illustrated using Cayley graphs. Therefore, this research introduced new variants of insertion and deletion systems that contribute to the advancement of DNA computing and also showcased their application in group theory.
format	Thesis
qualification_level	Master's degree
author	Yosman, Ahmad Firdaus
author_facet	Yosman, Ahmad Firdaus
author_sort	Yosman, Ahmad Firdaus
title	New variants of insertion and deletion systems in formal languages
title_short	New variants of insertion and deletion systems in formal languages
title_full	New variants of insertion and deletion systems in formal languages
title_fullStr	New variants of insertion and deletion systems in formal languages
title_full_unstemmed	New variants of insertion and deletion systems in formal languages
title_sort	new variants of insertion and deletion systems in formal languages
granting_institution	Universiti Teknologi Malaysia, Faculty of Science
granting_department	Faculty of Science
publishDate	2017
url	http://eprints.utm.my/id/eprint/80862/1/AhmadFirdausYosmanMFS2017.pdf
_version_	1747818272188792832

New variants of insertion and deletion systems in formal languages

Similar Items