scientific article; zbMATH DE number 3564361
From MaRDI portal
Publication:4136592
zbMATH Open0362.68105MaRDI QIDQ4136592FDOQ4136592
Publication date: 1974
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Diophantine equations (11D99)
Cited In (10)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Complexity of the word problem for commutative semigroups of fixed dimension
- Catalytic P systems, semilinear sets, and vector addition systems
- On the reachability problem for 5-dimensional vector addition systems
- Simple counter machines and number-theoretic problems
- The equality problem for vector addition systems is undecidable
- Finite automata with multiplication
- Title not available (Why is that?)
- Some decision problems related to the reachability problem for Petri nets
- A unified approach for deciding the existence of certain petri net paths
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 Q4136592)
