On the rationality of Petri net languages
From MaRDI portal
Publication:1073575
DOI10.1016/0020-0190(86)90060-8zbMath0588.68037OpenAlexW2075261907MaRDI QIDQ1073575
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90060-8
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Fine covers of a VAS language ⋮ The context-freeness of the languages associated with vector addition systems is decidable
Cites Work
This page was built for publication: On the rationality of Petri net languages