Open AccessThe Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops
Author(s) -
Marius Bozga,
Radu Iosif,
Filip Konečny
Publication year - 2014
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - reachability , computer science , reachability problem , theoretical computer science