Sciweavers

Share
JUCS
2002

Some Remarks on Codes Defined by Petri Nets

9 years 6 months ago
Some Remarks on Codes Defined by Petri Nets
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequence lead to positive markings. We prove that any CPN language can be accepted by a partially blind multicounter machine, and that any partially blind multicounter language is the morphic image of some CPN language. As a corollary we obtain the decidability of membership, emptiness and finiteness problem for CPN languages. We characterize the very strictly bounded regular languages, which are CPN languages, and give a condition for a Petri net, which ensures that its generated language is regular. We give a dense CPN language and prove that no dense regular language is a CPN language. Key Words: Petri nets, codes, formal languages Category: F. 4.2, F. 4.3
Masami Ito, Jürgen Dassow, Ralf Stiebe
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where JUCS
Authors Masami Ito, Jürgen Dassow, Ralf Stiebe
Comments (0)
books