000 03298nam a22005895i 4500
001 978-3-642-15349-5
003 DE-He213
005 20240730181649.0
007 cr nn 008mamaa
008 100821s2010 gw | s |||| 0|eng d
020 _a9783642153495
_9978-3-642-15349-5
024 7 _a10.1007/978-3-642-15349-5
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aReachability Problems
_h[electronic resource] :
_b4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings /
_cedited by Antonin Kucera, Igor Potapov.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aX, 199 p. 42 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6227
505 0 _aDescriptional 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.
650 0 _aComputer programming.
_94169
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9125693
650 1 4 _aProgramming Techniques.
_9125694
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9125695
700 1 _aKucera, Antonin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9125696
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9125697
710 2 _aSpringerLink (Online service)
_9125698
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642153488
776 0 8 _iPrinted edition:
_z9783642153501
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6227
_9125699
856 4 0 _uhttps://doi.org/10.1007/978-3-642-15349-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91011
_d91011