DocumentCode
3231198
Title
Parsing for languages of String Token Petri Nets
Author
Gloria, D. K Shirley
Author_Institution
Sathyabama Univ., Chennai, India
fYear
2010
fDate
23-26 Sept. 2010
Firstpage
1577
Lastpage
1584
Abstract
For a given word and a String Token Petri Net (STPN), we can check whether the given STPN accepts the given word using parsing. Also, for a given regular expression, we can construct a STPN that accepts the given regular expression.
Keywords
Petri nets; formal languages; grammars; STPN; parsing languages; string token Petri nets; Fires; Parse Trees and Derivations;
fLanguage
English
Publisher
ieee
Conference_Titel
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4244-6437-1
Type
conf
DOI
10.1109/BICTA.2010.5645264
Filename
5645264
Link To Document