Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory

formal language theory is a branch of applied discrete mathematics and theoretical computer science. a watson-crick automaton is an automaton that works on tapes which are double-stranded sequences of symbols related by watson-crick complementarity that are similar to the dna molecules. a petri net...

Full description

Saved in:

Bibliographic Details
Main Author:	Mohamad Jan, Nurhidaya
Format:	Thesis
Language:	English
Published:	2017
Subjects:	QA Mathematics
Online Access:	http://eprints.utm.my/id/eprint/81714/1/NurhidayahMohamadJanPFS2017.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.81714
record_format	uketd_dc
spelling	my-utm-ep.817142019-09-22T07:25:56Z Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory 2017 Mohamad Jan, Nurhidaya QA Mathematics formal language theory is a branch of applied discrete mathematics and theoretical computer science. a watson-crick automaton is an automaton that works on tapes which are double-stranded sequences of symbols related by watson-crick complementarity that are similar to the dna molecules. a petri net is a model of information flow in systems that provides a useful mathematical formalism for modelling concurrent systems. in this thesis, the relation between watson-crick automata and petri nets is investigated to consider the massive parallelism in watson- crick automata. thus, a new concept called watson-crick petri net is introduced. besides that, the structural properties of watson-crick petri net are found, namely a single start place, a run place and the stop transition. also, the generative power of watson-crick petri net is determined. besides using watson-crick complementarity in petri nets, a context-free grammar is also considered in this research. a petri net controlled grammar is a type of a context-free grammar equipped with petri nets, where the successful derivation of the grammar can be simulated by the sequence of occurrences of the net. the production rules of a grammar, for all variants of petri net controlled grammars that have been introduced, are associated only with transitions of a petri net. therefore, a place-labelled petri net controlled grammar is introduced in this research. the place labelling enables the parallel application of production rules in petri net controlled grammars to be considered. the effects of labelling strategies and the set of final markings, along with lower and upper bounds are chosen in order to increase the generative power of place-labelled petri net controlled grammar. besides that, the structural properties and structural subclass of place-labelled petri net controlled grammar are also found in this thesis. 2017 Thesis http://eprints.utm.my/id/eprint/81714/ http://eprints.utm.my/id/eprint/81714/1/NurhidayahMohamadJanPFS2017.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:126164 phd doctoral Universiti Teknologi Malaysia Mathematics
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Mohamad Jan, Nurhidaya Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
description	formal language theory is a branch of applied discrete mathematics and theoretical computer science. a watson-crick automaton is an automaton that works on tapes which are double-stranded sequences of symbols related by watson-crick complementarity that are similar to the dna molecules. a petri net is a model of information flow in systems that provides a useful mathematical formalism for modelling concurrent systems. in this thesis, the relation between watson-crick automata and petri nets is investigated to consider the massive parallelism in watson- crick automata. thus, a new concept called watson-crick petri net is introduced. besides that, the structural properties of watson-crick petri net are found, namely a single start place, a run place and the stop transition. also, the generative power of watson-crick petri net is determined. besides using watson-crick complementarity in petri nets, a context-free grammar is also considered in this research. a petri net controlled grammar is a type of a context-free grammar equipped with petri nets, where the successful derivation of the grammar can be simulated by the sequence of occurrences of the net. the production rules of a grammar, for all variants of petri net controlled grammars that have been introduced, are associated only with transitions of a petri net. therefore, a place-labelled petri net controlled grammar is introduced in this research. the place labelling enables the parallel application of production rules in petri net controlled grammars to be considered. the effects of labelling strategies and the set of final markings, along with lower and upper bounds are chosen in order to increase the generative power of place-labelled petri net controlled grammar. besides that, the structural properties and structural subclass of place-labelled petri net controlled grammar are also found in this thesis.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Mohamad Jan, Nurhidaya
author_facet	Mohamad Jan, Nurhidaya
author_sort	Mohamad Jan, Nurhidaya
title	Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
title_short	Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
title_full	Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
title_fullStr	Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
title_full_unstemmed	Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
title_sort	watson-crick petri net and place-labelled petri net controlled grammar using formal language theory
granting_institution	Universiti Teknologi Malaysia
granting_department	Mathematics
publishDate	2017
url	http://eprints.utm.my/id/eprint/81714/1/NurhidayahMohamadJanPFS2017.pdf
_version_	1747818396089581568

Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory

Similar Items