scientific article; zbMATH DE number 3974313

zbMATH Open0603.68064MaRDI QIDQ3740253FDOQ3740253

Authors: A. Bagyinszki-Orosz, János Bagyinszki 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3892612
• scientific article; zbMATH DE number 4001509
• A complexity characteristic of Petri net languages
• Some results on Petri net languages
• On the properties of the intersection of Petri net languages and context free languages

zbMATH Keywords

block-reduced languageselementary substitutioninput languages of Petri netsirreducible languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (8)

• Title not available (Why is that?)
• Deterministic weak-and-marked Petri net languages are regular
• Title not available (Why is that?)
• Some results on Petri net languages
• Title not available (Why is that?)
• Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
• Title not available (Why is that?)
• On capacity of labeled Petri net languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740253)