scientific article; zbMATH DE number 3974313

MaRDI QIDQ3740253zbMATH OpenFDO

Authors A. Bagyinszki-Orosz, János Bagyinszki

Publication date 1986

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)

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

Cited in

(8)

• scientific article; zbMATH DE number 3915636 (Why is no real title available?)
• Deterministic weak-and-marked Petri net languages are regular
• scientific article; zbMATH DE number 4001509 (Why is no real title available?)
• Some results on Petri net languages
• scientific article; zbMATH DE number 4035162 (Why is no real title available?)
• Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
• scientific article; zbMATH DE number 3892612 (Why is no real title available?)
• 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)