LEADER 03623nam  22007455  450 
001 996466303003316
005 20230221224555.0
010   $a1-280-38851-X
010   $a9786613566430
010   $a3-642-15349-6
024 7 $a10.1007/978-3-642-15349-5
035   $a(CKB)2670000000036399
035   $a(SSID)ssj0000446730
035   $a(PQKBManifestationID)11310113
035   $a(PQKBTitleCode)TC0000446730
035   $a(PQKBWorkID)10497905
035   $a(PQKB)10786462
035   $a(DE-He213)978-3-642-15349-5
035   $a(MiAaPQ)EBC3065691
035   $a(PPN)149018401
035   $a(EXLCZ)992670000000036399
100   $a20100821d2010      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aReachability Problems$b[electronic resource] $e4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings /$fedited by Antonin Kucera, Igor Potapov
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (X, 199 p. 42 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6227
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-15348-8 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6227
606   $aComputer programming
606   $aSoftware engineering
606   $aCompilers (Computer programs)
606   $aComputer science
606   $aMachine theory
606   $aProgramming Techniques
606   $aSoftware Engineering
606   $aCompilers and Interpreters
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
615  0$aComputer programming.
615  0$aSoftware engineering.
615  0$aCompilers (Computer programs).
615  0$aComputer science.
615  0$aMachine theory.
615 14$aProgramming Techniques.
615 24$aSoftware Engineering.
615 24$aCompilers and Interpreters.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
676   $a511.35
702   $aKucera$b Antonin$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aRP 2010
906   $aBOOK
912   $a996466303003316
996   $aReachability Problems$92929641
997   $aUNISA