Automata, Languages and Programming : 10th Colloquium Barcelona, Spain, July 18¿22, 1983 - Taschenbuch
1983, ISBN: 3540123172
[EAN: 9783540123170], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], MONOID; ALGORITHMS; COMPLEXITY; CONSTANT; DATASTRUCTURE; DISTRIBUTEDSYSTEMS; GRAMMARS; HARDWARE; LOGIC; NETWORK… Mehr…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
1983, ISBN: 3540123172
[EAN: 9783540123170], Neubuch, [PU: Springer Berlin Heidelberg Jun 1983], MONOID; ALGORITHMS; COMPLEXITY; CONSTANT; DATASTRUCTURE; DISTRIBUTEDSYSTEMS; GRAMMARS; HARDWARE; LOGIC; NETWORK; … Mehr…
AbeBooks.de BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
1983, ISBN: 3540123172
1983 Kartoniert / Broschiert Computerprogrammierung und Softwareentwicklung, Monoid; algorithms; complexity; constant; datastructure; distributedsystems; Grammars; Hardware; logic; Netw… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Automata, Languages and Programming. Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings. - Taschenbuch
1983, ISBN: 3540123172
[EAN: 9783540123170], [SC: 3.0], [PU: Berlin, Springer Berlin Heidelberg], Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with sta… Mehr…
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Versandkosten: EUR 3.00 Details... |
Automata, languages and programming. - Berlin [West] : Springer 10, Barcelona, Spain, July 18-22, 1983 - gebrauchtes Buch
1983, ISBN: 9783540123170
VIII, 731 S. : graph. Darst., [PU: Springer, Berlin/Heidelberg]
Antikbuch24.de |
Automata, Languages and Programming : 10th Colloquium Barcelona, Spain, July 18¿22, 1983 - Taschenbuch
1983, ISBN: 3540123172
[EAN: 9783540123170], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], MONOID; ALGORITHMS; COMPLEXITY; CONSTANT; DATASTRUCTURE; DISTRIBUTEDSYSTEMS; GRAMMARS; HARDWARE; LOGIC; NETWORK… Mehr…
1983, ISBN: 3540123172
[EAN: 9783540123170], Neubuch, [PU: Springer Berlin Heidelberg Jun 1983], MONOID; ALGORITHMS; COMPLEXITY; CONSTANT; DATASTRUCTURE; DISTRIBUTEDSYSTEMS; GRAMMARS; HARDWARE; LOGIC; NETWORK; … Mehr…
1983
ISBN: 3540123172
1983 Kartoniert / Broschiert Computerprogrammierung und Softwareentwicklung, Monoid; algorithms; complexity; constant; datastructure; distributedsystems; Grammars; Hardware; logic; Netw… Mehr…
Automata, Languages and Programming. Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings. - Taschenbuch
1983, ISBN: 3540123172
[EAN: 9783540123170], [SC: 3.0], [PU: Berlin, Springer Berlin Heidelberg], Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with sta… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Automata, Languages and Programming
EAN (ISBN-13): 9783540123170
ISBN (ISBN-10): 3540123172
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1983
Herausgeber: Springer Berlin
Buch in der Datenbank seit 2007-11-05T16:33:13+01:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-31T10:32:44+02:00 (Vienna)
ISBN/EAN: 9783540123170
ISBN - alternative Schreibweisen:
3-540-12317-2, 978-3-540-12317-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: diaz
Titel des Buches: spain, barcelona, programming languages, west berlin mauer, the programming language, colloquium, lecture notes computer science automata
Daten vom Verlag:
Autor/in: J. Diaz
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - 10th Colloquium Barcelona, Spain, July 18–22, 1983
Verlag: Springer; Springer Berlin
737 Seiten
Erscheinungsjahr: 1983-06-01
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 737 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Monoid; algorithms; automata; complexity; constant; data structure; distributed systems; grammars; hardware; logic; network; parallelism; programming; semantics; theorem proving; Theory of Computation; Formal Languages and Automata Theory; Programming Techniques; Computerprogrammierung und Softwareentwicklung; EA
On semantic foundations for applicative multiprogramming.- An axiomatization of the intermittent assertion method using temporal logic.- Topological characterizations of infinite behaviours of transition systems.- Linear time and branching time semantics for recursion with merge.- Processes and a fair semantics for the ADA rendez-vous.- Conditional dependencies for horizontal decompositions.- On the relationship of CCS and CSP.- Behavioural equivalence relations induced by programming logics.- Lower bounds for constant depth circuits for prefix problems.- Test sets for morphisms with bounded delay.- Symmetric and economical solutions to the mutual exclusion problem in a distributed system.- Ambiguity and decision problems concerning number systems.- On the observational semantics of fair parallelism.- An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching.- Algebraic languages and polyomnoes enumeration.- On the number of equal-sized semispaces of a set of points in the plane.- Algebraic specifications with generating constraints.- Wythoff games, continued fractions, cedar trees and Fibonacci searches.- Initial index: A new complexity function for languages.- Modular compiler descriptions based on abstract semantic data types (Extended Abstract).- Polynomial-time factorization of multivariate polynomials over finite fields.- Processes of place/transition-nets.- A hardware semantics based on temporal intervals.- Lower bounds for solving undirected graph problems on VLSI.- Concurrent probabilistic program, or: How to schedule if you must.- Computation times of NP sets of different densities.- Rewrite methods for clausal and non-clausal theorem proving.- Complexity of infinite trees.- Incremental construction of unification algorithms in equational theories.- Tree automata and attribute grammars.- Effectively given spaces.- A note on intersections of free submonoids of a free monoid.- A fast sorting algorithm for VLSI.- On the composition of morphisms and inverse morphisms.- On the group complexity of a finite language.- Reasoning with time and chance.- Factoring multivariate integral polynomials.- On the study data structures: Binary tournaments with repeated keys.- Minimizing width in linear layouts.- Proving precedence properties: The temporal way.- An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language.- Searchability in merging and implicit data structures.- Strong abstract interpretation using power domains.- Testing equivalences for processes.- Specification-oriented semantics for communicating processes.- Complexity classes of alternating machines with oracles.- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots.- Parallel dictionaries on 2–3 trees.- Varietes de semigroupes et mots infinis.- Arbres et hierarchies de concatenation.- A multiprocess network logic with temporal and spatial modalities.- Enumeration of success patterns in logic programs.- Immunity.- Power domains and predicate transformers: A topological view.- Recognition and isomorphism of two dimensional partial orders.- On the simulation of many storage heads by a single one.- Synchronisation trees.- Cutting and partitioning a graph after a fixed pattern.- Context-free controlled etol systems.- Referees for ICALP-83.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)
< zum Archiv...