Litcius/Paper detail

Reachability of scope-bounded multistack pushdown systems

Salvatore La Torre, Margherita Napoli, Gennaro Parlato

2020Information and Computation10 citationsDOI

Topics & Concepts

Undecidable problemReachabilityPushdown automatonDecidabilityReachability problemComputer scienceBounded functionTheoretical computer scienceScope (computer science)Discrete mathematicsMatching (statistics)AutomatonMathematicsProgramming languageStatisticsMathematical analysisFormal Methods in VerificationLogic, programming, and type systemssemigroups and automata theory
Reachability of scope-bounded multistack pushdown systems | Litcius