Petri nets and szilard languages
From MaRDI portal
Publication:4125805
DOI10.1016/S0019-9958(77)90558-7zbMath0354.68098MaRDI QIDQ4125805
No author found.
Publication date: 1977
Published in: Information and Control (Search for Journal in Brave)
Related Items (15)
Evolution and observation -- a non-standard way to generate formal languages ⋮ Generalized Nets as a Tool for the Modelling of Data Mining Processes ⋮ Recursivite et cônes rationnels fermés par intersection ⋮ Unnamed Item ⋮ Petri nets and regular languages ⋮ k-Petri Net Controlled Grammars ⋮ Algebraic structure of some stochastic discrete event systems, with applications ⋮ Concurrent regular expressions and their relationship to Petri nets ⋮ The context-freeness of the languages associated with vector addition systems is decidable ⋮ Counter machines, Petri nets, and consensual computation ⋮ Learning semilinear sets from examples and via queries ⋮ A decidability theorem for a class of vector-addition systems ⋮ Unnamed Item ⋮ Computation sequence sets ⋮ A normal form theorem for label grammars
This page was built for publication: Petri nets and szilard languages