scientific article; zbMATH DE number 3564361
From MaRDI portal
Publication:4136592
zbMath0362.68105MaRDI QIDQ4136592
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Diophantine equations (11D99)
Related Items (10)
Catalytic P systems, semilinear sets, and vector addition systems ⋮ Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ Simple counter machines and number-theoretic problems ⋮ Unnamed Item ⋮ On the reachability problem for 5-dimensional vector addition systems ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ Finite automata with multiplication ⋮ Some decision problems related to the reachability problem for Petri nets ⋮ The equality problem for vector addition systems is undecidable ⋮ Complexity of the word problem for commutative semigroups of fixed dimension
This page was built for publication:
