Conferences in DBLP

(rp)
2010 (conf/rp/2010)

1. 
   Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. [Citation Graph (, )][DBLP]
   
   
2. 
   Symbolic and Compositional Reachability for Timed Automata. [Citation Graph (, )][DBLP]
   
   
3. 
   Temporal Logics over Linear Time Domains Are in PSPACE. [Citation Graph (, )][DBLP]
   
   
4. 
   Lossy Counter Machines Decidability Cheat Sheet. [Citation Graph (, )][DBLP]
   
   
5. 
   Behavioral Cartography of Timed Automata. [Citation Graph (, )][DBLP]
   
   
6. 
   On the Joint Spectral Radius for Bounded Matrix Languages. [Citation Graph (, )][DBLP]
   
   
7. 
   Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P. [Citation Graph (, )][DBLP]
   
   
8. 
   Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. [Citation Graph (, )][DBLP]
   
   
9. 
   Rewriting Systems for Reachability in Vector Addition Systems with Pairs. [Citation Graph (, )][DBLP]
   
   
10. 
    The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. [Citation Graph (, )][DBLP]
    
    
11. 
    Depth Boundedness in Multiset Rewriting Systems with Name Binding. [Citation Graph (, )][DBLP]
    
    
12. 
    Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. [Citation Graph (, )][DBLP]
    
    
13. 
    Efficient Graph Reachability Query Answering Using Tree Decomposition. [Citation Graph (, )][DBLP]