Pham Tra An

Abstract

        A new complexity characteristic of Petri net languages is introduced. Some necessary conditions for Petri net languages are established and a series of simple languages not acceptable by Petri nets are given.