E-Book, Englisch, 199 Seiten, eBook
Kucera / Potapov Reachability Problems
Erscheinungsjahr 2010
ISBN: 978-3-642-15349-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings
E-Book, Englisch, 199 Seiten, eBook
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-642-15349-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.- Symbolic and Compositional Reachability for Timed Automata.- Temporal Logics over Linear Time Domains Are in PSPACE.- Lossy Counter Machines Decidability Cheat Sheet.- Behavioral Cartography of Timed Automata.- On the Joint Spectral Radius for Bounded Matrix Languages.- Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P.- Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata.- Rewriting Systems for Reachability in Vector Addition Systems with Pairs.- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions.- Depth Boundedness in Multiset Rewriting Systems with Name Binding.- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.- Efficient Graph Reachability Query Answering Using Tree Decomposition.
