Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
From MaRDI portal
Publication:5060183
DOI10.46298/lmcs-18(4:11)2022OpenAlexW4312138254MaRDI QIDQ5060183
Publication date: 9 January 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.03025v5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-memory automata
- Context-free languages over infinite alphabets
- What makes Petri nets harder to verify: stack or data?
- Special section on coloured Petri nets
- Approaching the coverability problem continuously
- Continuous reachability for unordered data Petri nets is in PTime
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Depth Boundedness in Multiset Rewriting Systems with Name Binding
- Free Choice Petri Nets
- Reducibility among Combinatorial Problems
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Solving linear programs in the current matrix multiplication time
- Turing Machines with Atoms
- Occam's razor applied to the Petri net coverability problem
This page was built for publication: Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
