The unsolvability of some Petri net language problems
From MaRDI portal
Publication:599503
Cites work
- scientific article; zbMATH DE number 3607505 (Why is no real title available?)
- Computation sequence sets
- Termination Properties of Generalized Petri Nets
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
This page was built for publication: The unsolvability of some Petri net language problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599503)