On one context-free language for producer/consumer Petri net with the unbounded buffer

Abstract

We consider the producer/consumer Petri net and the context-free formal language that it generates. Nonregularity of the language is proved, the corresponding pushdown automaton and context-free grammar are obtained. The connection with the Dyck formal language is pointed out.