Automata, Languages and Programming : 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings - edizione con copertina flessibile
1990, ISBN: 3540528261
[EAN: 9783540528265], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], EDV / THEORIE PROGRAMMIEREN ALLGEMEINES; RHETORIK (SPRACHE); SPRACHE - ZEICHENSPRACHE; AUTOMAT; LAYOUT; ALGORIT… Altro …
| ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Costi di spedizione:Versandkostenfrei. (EUR 0.00) Details... |
ISBN: 9783540528265
This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Scienc… Altro …
| BarnesandNoble.com new in stock. Costi di spedizione:zzgl. Versandkosten., Costi di spedizione aggiuntivi Details... |
Automata, languages and programming: 17th International Colloquium Warwick University, England, July 1990; Proceedings Lecture notes in computer science ; Vol. 443 - edizione con copertina flessibile
1990, ISBN: 3540528261
[EAN: 9783540528265], Gebraucht, sehr guter Zustand, [SC: 2.7], [PU: Springer Verlag;], IX, 780 Seiten; graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaf… Altro …
| ZVAB.com books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Koblenz, Germany [1048006] [Rating: 5 (von 5)] NOT NEW BOOK. Costi di spedizione: EUR 2.70 Details... |
ISBN: 9783540528265
Automata Languages and Programming ab 138.99 € als Taschenbuch: 17th International Colloquium Warwick University England July 16-20 1990 Proceedings. Auflage 1990. Aus dem Bereich: Bücher… Altro …
| Hugendubel.de Costi di spedizione:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 7.50) Details... |
1990, ISBN: 9783540528265
17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1990
| lehmanns.de Costi di spedizione:Versand in 10-14 Tagen. (EUR 0.00) Details... |
Automata, Languages and Programming : 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings - edizione con copertina flessibile
1990, ISBN: 3540528261
[EAN: 9783540528265], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], EDV / THEORIE PROGRAMMIEREN ALLGEMEINES; RHETORIK (SPRACHE); SPRACHE - ZEICHENSPRACHE; AUTOMAT; LAYOUT; ALGORIT… Altro …
ISBN: 9783540528265
This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Scienc… Altro …
Automata, languages and programming: 17th International Colloquium Warwick University, England, July 1990; Proceedings Lecture notes in computer science ; Vol. 443 - edizione con copertina flessibile
1990
ISBN: 3540528261
[EAN: 9783540528265], Gebraucht, sehr guter Zustand, [SC: 2.7], [PU: Springer Verlag;], IX, 780 Seiten; graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaf… Altro …
ISBN: 9783540528265
Automata Languages and Programming ab 138.99 € als Taschenbuch: 17th International Colloquium Warwick University England July 16-20 1990 Proceedings. Auflage 1990. Aus dem Bereich: Bücher… Altro …
1990, ISBN: 9783540528265
17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1990
Dati bibliografici del miglior libro corrispondente
| Autore: | |
| Titolo: | |
| ISBN: |
Informazioni dettagliate del libro - Automata, Languages and Programming: 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings Michael S. Paterson Edi
EAN (ISBN-13): 9783540528265
ISBN (ISBN-10): 3540528261
Copertina flessibile
Anno di pubblicazione: 1990
Editore: Springer Berlin Heidelberg Core >1 >T
781 Pagine
Peso: 1,186 kg
Libro nella banca dati dal 2007-02-13T03:24:08+01:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-01-20T06:07:09+01:00 (Zurich)
ISBN/EAN: 3540528261
ISBN - Stili di scrittura alternativi:
3-540-52826-1, 978-3-540-52826-5
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : paterson, geometry
Titolo del libro: ing 1990, warwick, proceedings the international colloquium language, automata languages and programming, lecture notes computer science automata, language england
Dati dell'editore
Autore: Michael S. Paterson
Titolo: Lecture Notes in Computer Science; Automata, Languages and Programming - 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings
Editore: Springer; Springer Berlin
788 Pagine
Anno di pubblicazione: 1990-07-02
Berlin; Heidelberg; DE
Lingua: Inglese
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XII, 788 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; Layout; algorithms; complexity; computer science; data structure; formal language; knowledge base; programming; programming language; robot; robotics; semantics; term rewriting; verification; data structures; combinatorics; algorithm analysis and problem complexity; Theory of Computation; Formal Languages and Automata Theory; Data Science; Discrete Mathematics; Algorithms; Artificial Intelligence; Datenbanken; Diskrete Mathematik; Algorithmen und Datenstrukturen; Künstliche Intelligenz; EA
LEDA: A library of efficient data types and algorithms.- A new universal class of hash functions and dynamic hashing in real time.- A complete and decidable proof system for call-by-value equalities.- Static correctness of hierarchical procedures.- Generic terms having no polymorphic types.- A complete system of B-rational identities.- On non-counting regular classes.- Two-way automata with multiplicity.- ?-Continuous semirings, algebraic systems and pushdown automata.- Nondeterministic computations in sublogarithmic space and space constructibility.- Normalizing and accelerating RAM computations and the problem of reasonable space measures.- A formal study of learning via queries.- Language learning by a “team”.- Functions as processes.- A domain-theoretic model for a higher-order process calculus.- Concurrency, automata and domains.- A theory of communicating processes with value-passing.- Analytic variations on the common subexpression problem.- Can a maximum flow be computed in o(nm) time?.- On the distributional complexity of disjointness.- Computing boolean functions on anonymous networks.- On the composition of zero-knowledge proof systems.- Additional queries to random and pseudorandom oracles.- Communication among relations.- Stability and sequentiality in dataflow networks.- Automata for modeling real-time systems.- Markov decision processes and regular events.- Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond.- Nonoblivious normalization algorithms for nonlinear rewrite systems.- Algebraic properties of idempotent substitutions.- Determining the separation of preprocessed polyhedra — A unified approach.- Randomized incremental construction of delaunay and Voronoi diagrams.- Merging free trees in parallel for efficient voronoidiagram construction.- Local optimization and the Traveling Salesman Problem.- Polynomial-time approximation algorithms for the ising model.- On parallelizing graph-partitioning heuristics.- Iterated substitutions and locally catenative systems: a decidability result in the binary case.- Decomposition of partial commutations.- Boolean closure and unambiguity of rational sets.- Compositionality through an operational semantics of contexts.- Structural and behavioural equivalences of networks.- Proving partial order liveness properties.- A proof system for the parallel object-oriented language POOL.- A new approach to maximum matching in general graphs.- On-line graph algorithms with SPQR-trees.- On the bit-complexity of discrete solutions of PDEs: Compact multigrid.- An efficient algorithm for branching bisimulation and stuttering equivalence.- Partial evaluation, self-application and types.- Provable computable functions on abstract data types.- Equational formulas in order-sorted algebras.- An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal.- Approximation of convex polygons.- On the rectilinear art gallery problem.- On parallel hashing and integer sorting.- The parallel simplicity of compaction and chaining.- The importance of the left merge operator in process algebras.- Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming.Altri libri che potrebbero essere simili a questo:
Ultimo libro simile:
9780387528267 Automata, Languages and Programming: 17th International Colloquium Warwick University, England, July 16-20, 1990 Proceedings (I C A L P//AUTOMATA, LANGUAGES, AND PROGRAMMING) (Michael S. Paterson)
- 9780387528267 Automata, Languages and Programming: 17th International Colloquium Warwick University, England, July 16-20, 1990 Proceedings (I C A L P//AUTOMATA, LANGUAGES, AND PROGRAMMING) (Michael S. Paterson)
- 9780387557199 Automata, Languages and Programming: 19th International Colloquium, Wien, Austria, July 13-17, 1992 : Proceedings (I C a L P//Automata, Languages, and Programming) (W. Kuich)
- 9780387542331 Automata, Languages and Programming: Icalp '91-18th International Colloquium Madrid, Spain, July 8-12, 1991 Proceedings (I C a L P//Automata, Languages, and Programming) (Albert Leach~B. Monien~M. Rodriguez Artalejo)
- 9780387569390 Spyware and Adware (Aycock, John)
- 9780387777405 Spyware and Adware (John Aycock)
< Per archiviare...