Reachability Problems [[electronic resource] ] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / / edited by Antonin Kucera, Igor Potapov
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Reachability Problems [[electronic resource] ] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / / edited by Antonin Kucera, Igor Potapov
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Edizione: | 1st ed. 2010. |
| Descrizione fisica: | 1 online resource (X, 199 p. 42 illus.) |
| Disciplina: | 511.35 |
| Soggetto topico: | Computer programming |
| Software engineering | |
| Compilers (Computer programs) | |
| Computer science | |
| Machine theory | |
| Programming Techniques | |
| Software Engineering | |
| Compilers and Interpreters | |
| Computer Science Logic and Foundations of Programming | |
| Formal Languages and Automata Theory | |
| Persona (resp. second.): | KuceraAntonin |
| PotapovIgor | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Reachability Problems |
| ISBN: | 1-280-38851-X |
| 9786613566430 | |
| 3-642-15349-6 | |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466303003316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 6227