|Title:||A Pumping Lemma for Monotonous Super-Nets Languages
|Authors:||O. Gerstel. Z. Harpaz, R. Rinat
|Abstract:||A pumping lemma for languages recognized by a restricted type of Supef-nets is presented. This type of Super-nets, called monotonous, differs from the ussual Super-nets in the absence of restricting places, inhibiting arcs and lambda-transitions. The lemma can be used to prove languages to be uhrecognizable by monotonous Super-nets. An immediate corollary is the application of the lemma to other known types of Petri-nets. It is notable that the pumping lemma is very similar in structure to the one for regular languages.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0382), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1985
To the main CS technical reports page
Computer science department, Technion