We study the reachability problem for one-counter automata in which transitions can carry disequality tests. A disequality test is a guard that prohibits a specified counter value. This reachability problem has been known to be NP-hard and in PSPACE, and characterising its computational complexity h...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!