- 0 Ergebnisse
Kleinster Preis: € 64,19, größter Preis: € 306,94, Mittelwert: € 122,69
1
Reachability Problems: 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings (Lecture Notes in Computer Science, 6227, Band 6227)
Bestellen
bei amazon.de
€ 91,32
Versand: € 3,001
Bestellen
gesponserter Link

Reachability Problems: 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings (Lecture Notes in Computer Science, 6227, Band 6227) - Taschenbuch

2010, ISBN: 9783642153488

Springer, Taschenbuch, Auflage: 2010, 209 Seiten, Publiziert: 2010-08-18T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 31073454, 0.7 kg, Informatik, IT-Ausbildung & -Berufe, Computer & … Mehr…

Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) ausverkauf
2
Reachability Problems - Antonin Kucera
Bestellen
bei BookDepository.com
€ 66,00
Versand: € 0,001
Bestellen
gesponserter Link

Antonin Kucera:

Reachability Problems - Taschenbuch

2010, ISBN: 9783642153488

Paperback, [PU: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG], Constitutes the research papers presented at the 4th International Workshop, RP 2010 held in Brno, Czech Republic, Au… Mehr…

Versandkosten:Versandkostenfrei. (EUR 0.00)
3
Bestellen
bei Biblio.co.uk
$ 360,53
(ca. € 306,94)
Versand: € 51,071
Bestellen
gesponserter Link
Antonin Kucera and Igor Potapov:
Reachability Problems: 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings (Lecture Notes in Computer Science) - neues Buch

2010

ISBN: 9783642153488

2010-12-23. New. Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. May be re-issue. Buy with confidence, excellent customer service!, 2010-12-23, 6

Versandkosten: EUR 51.07 Books Express
4
Reachability Problems - Antonin Kucera; Igor Potapov
Bestellen
bei lehmanns.de
€ 64,19
Versand: € 0,001
Bestellen
gesponserter Link
Antonin Kucera; Igor Potapov:
Reachability Problems - Taschenbuch

2010, ISBN: 9783642153488

4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2010

Versandkosten:Lieferbar (Termin unbekannt) (EUR 0.00)
5
Reachability Problems Theoretical Computer Science and General Issues - Antonin Kucera (editor), Igor Potapov (editor)
Bestellen
bei Blackwells.co.uk
£ 72,09
(ca. € 84,99)
Versand: € 7,661
Bestellen
gesponserter Link
Antonin Kucera (editor), Igor Potapov (editor):
Reachability Problems Theoretical Computer Science and General Issues - Taschenbuch

ISBN: 9783642153488

paperback, [PU: Springer, Berlin/Heidelberg/New York, NY]

in stock. Versandkosten:Usually dispatched within 7 days. (EUR 7.66) Blackwells.co.uk

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Details zum Buch
Reachability Problems

This book constitutes the research papers presented at the 4th International Workshop, RP 2010 held in Brno, Czech Republic, August 28-29, 2010 and was co-located with Joint MFCS and CSL 2010 (35th International Symposiums on Mathematical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). The revised 9 full papers and the 4 invited talks of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures (semigroups, groups and rings), frontiers between decidable and undecidable reachability problems, predictability in iterative maps and new computational paradigms.

Detailangaben zum Buch - Reachability Problems


EAN (ISBN-13): 9783642153488
ISBN (ISBN-10): 3642153488
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
197 Seiten
Gewicht: 0,202 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-02-14T20:18:07+01:00 (Vienna)
Detailseite zuletzt geändert am 2022-05-23T12:04:14+02:00 (Vienna)
ISBN/EAN: 9783642153488

ISBN - alternative Schreibweisen:
3-642-15348-8, 978-3-642-15348-8


Daten vom Verlag:

Autor/in: Antonin Kucera; Igor Potapov
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Reachability Problems - 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings
Verlag: Springer; Springer Berlin
199 Seiten
Erscheinungsjahr: 2010-08-18
Berlin; Heidelberg; DE
Gewicht: 0,329 kg
Sprache: Englisch
64,19 € (DE)
65,99 € (AT)
80,08 CHF (CH)
POD
X, 199 p. 42 illus.

BC; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Action; algebraic structures; automata; complexity; finite state machines; infinite state sy; infinite state systems; reachability problems; temporal logics; verification; C; Programming Techniques; Software Engineering/Programming and Operating Systems; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages; Programming Techniques; Software Engineering; Compilers and Interpreters; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Computer Science; Software Engineering; Compiler und Übersetzer; Theoretische Informatik; Theoretische Informatik; EA

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.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783319459936 Reachability Problems (Kim Guldstrand Larsen; Igor Potapov; Ji?í Srba)


< zum Archiv...