Abstract

On the Reachability Problem for Persistent Vector Replacement Systems. 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call