Abstract
The reachability problem for persistent vector replacement systems is shown to be decidable by giving an algorithm for constructing a semilinear representation of the reachability set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have