Structural properties of place-labeled Petri net controlled grammars

QR Code

Structural properties of place-labeled Petri net controlled grammars

A place-labeled Petri net controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The language consists of all terminal strings that can be obtained by parallelly applying of the rules of multisets which are th...

Full description

Bibliographic Details
Main Authors:	Mohamad Jan, Nurhidaya, Turaev, Sherzod, Fong, Wan Heng, Sarmin, Nor Haniza
Format:	Proceeding Paper
Language:	English
Published:	2014
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/42431/ http://irep.iium.edu.my/42431/1/Structural_Properties_of_Place-Labeled_-_ICCEMS.pdf

Similar Items

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

Place-labelled petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2017)

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

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

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

A new variant of Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)

Watson-Crick petri net languages: the effect of labeling strategies
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)

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

Grammars controlled by Petri Nets
by: Dassow, Juergen, et al.
Published: (2012)

Reverse Watson-Crick Petri nets
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)

Watson-Crick Petri net languages with finite sets of final markings
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)

Context-free petri net controlled grammars under parallel firing strategy
by: Mavlankulov, Gairatzhan, et al.
Published: (2016)

Parallel firing strategy on petri nets: a review
by: Mavlankulov, Gairatzhan, et al.
Published: (2015)

Grammars controlled by petri nets
by: Dassow, Juergen, et al.
Published: (2012)

Grammars controlled by petri nets with inhibitor arcs.
by: Turaev, Sherzod, et al.
Published: (2010)

Closure properties of Watson-Crick Petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2018)

Tree valence controlled grammars
by: Ashaari, Salbiah, et al.
Published: (2017)

Static watson-crick linear grammars and its computational power
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2019)

Multiset controlled grammars
by: Ashaari, Salbiah, et al.
Published: (2017)

A Survey of Petri Net Tools
by: Thong, Weng Jie, et al.
Published: (2015)

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

Language classes generated by tree controlled grammars with bounded nonterminal complexity
by: Turaev, Sherzod, et al.
Published: (2012)

Multiset controlled grammars: A normal form and closure properties
by: Ashaari, Salbiah, et al.
Published: (2017)

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

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

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

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)

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

Some properties of probabilistic one-sided sticker systems
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)

Parsing algorithms for grammars with regulated rewriting
by: Turaev, Sherzod, et al.
Published: (2011)

Watson–Crick context-free grammars: Grammar simpliﬁcations and a parsing algorithm
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2018)

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

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

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

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

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

Generative capacity of sticker systems with the presence of weights
by: Gan, Yee Siang, et al.
Published: (2017)

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