Regular Multi-Strings Token Petri Net

D. K. Shirley Gloria1 and D. K. Sheena Christy2


1Department of Mathematics, Dr. Ambedkar Government Arts College, Vyasarpadi, Chennai -- 600 039, Tamilnadu, India.
2Department of Mathematics, SRM Institute of Science and Technology, Kattankulathur -- 603 203, Tamilnadu, India.

Abstract: Every regular language can be caused by Multi-Strings Token Petri Net.
Keywords: Multi-Strings Token Petri Net(MSTPN), Regular Language(RL), Regular Grammar(RG).


Cite this article as: D. K. Shirley Gloria and D. K. Sheena Christy, Regular Multi-Strings Token Petri Net, Int. J. Math. And Appl., vol. 10, no. 1, 2022, pp. 79-84.

References
  1. Beulah Immanuel, K. Rangarajan and K. G. Subramanian, String-token Petri nets, In: Proceedings of the European Conference on Artificial Intelligence, One Day Workshop on Symbolic Networks at Valencia, Spain, (2004).
  2. James Peterson, Petrinet theory and modeling of systems, Prentice Hall, USA, (1997).
  3. S. Devi and D. K. Shirley Gloria, Context-Free Languages Of String Token Petri Nets, International Journal of Pure and Applied Mathematics, 113(2017), 96–104.
  4. D. K. Shirley Gloria, Beulah Immanuel and K. Rangarajan, Parallel Context-Free String-Token Petri Nets, International Journal of Pure and Applied Mathematics, 59(2010), 275-289.
  5. D. K. Shirley Gloria and D. K. Sheena Christy, Multi-Strings Token Petri Nets, International Conference on Instrumentation, MEMS and Biosensing Technology, (Submitted).
  6. Peter linz, An Introduction to Formal Languages and Automata, 5th Edition, Jones \& Bartlett Learning, LLC, (2012).

Back