The reachability problem for Petri nets and decision problems for Skolem arithmetic
From MaRDI portal
Publication:1148890
Cites work
- scientific article; zbMATH DE number 3001281 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3266625 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3366917 (Why is no real title available?)
- scientific article; zbMATH DE number 3375482 (Why is no real title available?)
- A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
- Decidability and essential undecidability
- Diem-Grade Logischer Entscheidungsprobleme
- Machine Configuration and Word Problems of Given Degree of Unsolvability
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Single premise Post canonical forms defined over one-letter alphabets
- Some post canonical systems in one letter
This page was built for publication: The reachability problem for Petri nets and decision problems for Skolem arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148890)