Pumping lemma of Petri net language

被引：0

作者：

Jiang, Chang-Jun ^{[1
]}

Liu, Guan-Jun ^{[2
]}

机构：

[1] Department of Computer, Tongji University, Shanghai 200092, China

[2] College of Information, Shandong University of Science and Technology, Qingdao 266510, China

来源：

Jisuanji Xuebao/Chinese Journal of Computers | 2006年 / 29卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：274 / 278

共 50 条

[41] Soft Petri Net
Bandyopadhyay, Sibasis
Suraj, Zbigniew
Nayak, Prasun Kumar
ROUGH SETS, IJCRS 2019, 2019, 11499 : 253 - 264
[42] Petri net reduction
Costea, Calin
Costea, Damian
Groza, Voicu
Groza, Bogdan
Costea, Diana
2007 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, 2007, : 1527 - 1530
[43] Extensional Petri net
Dong, Xiaoju
Fu, Yuxi
Varacca, Daniele
FORMAL ASPECTS OF COMPUTING, 2019, 31 (01) : 47 - 58
[44] UNIVERSAL PETRI NET
Zaitsev, D. A.
CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (04) : 498 - 511
[45] PETRI NET TOOLS
FELDBRUGGE, F
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 222 : 203 - 223
[46] A PUMPING LEMMA FOR FLIP-PUSHDOWN LANGUAGES
Kostolanyi, Peter
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2016, 50 (04): : 295 - 311
[47] A Generalized Pumping Lemma for Weighted Recognizable Languages
Maletti, Andreas
Nuernbergk, Nils Oskar
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
[48] A pumping lemma for random permitting context languages
Ewert, S
van der Walt, A
THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) : 959 - 967
[49] USING THE CONTEXT-FREE PUMPING LEMMA
BILLINGTON, D
COMMUNICATIONS OF THE ACM, 1993, 36 (04) : 21 - &
[50] A Pumping Lemma for Pushdown Graphs of Any Level
Parys, Pawel
29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 54 - 65