Some Remarks on Codes Defined by Petri Nets

Простая страница элемента
dc.creatorIto,Masami
dc.creatorDassow,Jürgen
dc.creatorStiebe,Ralf
dc.date2002
dc.date.accessioned2024-02-06T12:51:40Z
dc.date.available2024-02-06T12:51:40Z
dc.descriptionWith 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. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-008-02-0260
dc.identifierhttps://lib.jucs.org/article/27857/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8109
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 8(2): 260-269
dc.subjectPetri nets
dc.subjectcodes
dc.subjectformal languages
dc.titleSome Remarks on Codes Defined by Petri Nets
dc.typeResearch Article
Файлы
Коллекции