


default search action
4th RP 2010: Brno, Czech Republic
- Antonín Kucera, Igor Potapov:

Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings. Lecture Notes in Computer Science 6227, Springer 2010, ISBN 978-3-642-15348-8 - Markus Holzer

, Martin Kutrib
:
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. 1-23 - Kim Guldstrand Larsen:

Symbolic and Compositional Reachability for Timed Automata. 24-28 - Alexander Rabinovich

:
Temporal Logics over Linear Time Domains Are in PSPACE. 29-50 - Philippe Schnoebelen:

Lossy Counter Machines Decidability Cheat Sheet. 51-75 - Étienne André

, Laurent Fribourg:
Behavioral Cartography of Timed Automata. 76-90 - Paul Bell

, Vesa Halava, Mika Hirvensalo:
On the Joint Spectral Radius for Bounded Matrix Languages. 91-103 - Jakub Chaloupka:

Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P. 104-119 - Maurice Margenstern:

Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. 120-132 - Paulin Jacobé de Naurois, Virgile Mogbil:

Rewriting Systems for Reachability in Vector Addition Systems with Pairs. 133-145 - Martin Mundhenk, Felix Weiß:

The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. 146-160 - Fernando Rosa-Velardo

:
Depth Boundedness in Multiset Rewriting Systems with Name Binding. 161-175 - Zdenek Sawa:

Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. 176-182 - Fang Wei:

Efficient Graph Reachability Query Answering Using Tree Decomposition. 183-197

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














