Central Library

Normal view MARC view ISBD view

Reachability Problems [electronic resource] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / edited by Antonin Kucera, Igor Potapov.

Contributor(s): Kucera, Antonin [editor.] | Potapov, Igor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 6227Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: X, 199 p. 42 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642153495.Subject(s): 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 TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.11 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.