Automata, Languages and Programming
10th Colloquium Barcelona, Spain, July 18–22, 1983
572 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Produktinformation
- Utgivningsdatum:1983-06-01
- Mått:155 x 235 x 40 mm
- Vikt:1 112 g
- Format:Häftad
- Språk:Engelska, Franska
- Serie:Lecture Notes in Computer Science
- Antal sidor:737
- Upplaga:1983
- Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN:9783540123170
Utforska kategorier
Innehållsförteckning
- 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.
Mer från samma författare
GAMMA RAY AND PARTICLE PRODUCTION IN HEAVY ION REACTIONS - PROCEEDINGS OF II TAPS WORKSHOP
SCHUTZ MARTINEZ SCHUTZ J DIAZ, J Díaz, G Martínez, Y Schutz
Inbunden, 1994
3 562 kr
Mer från samma serie
Multiobjective Optimization
Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński
Häftad, 2008
556 kr
Knowledge Graphs
Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang
Häftad, 2026
932 kr
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
572 kr
Energy Informatics
Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin
Häftad, 2025
842 kr
Biomimetic and Biohybrid Systems
Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott
Häftad, 2025
1 022 kr
- Nyhet
Advanced Parallel Processing Technologies
Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson
Häftad, 2026
1 022 kr
Progress in Cryptology - AFRICACRYPT 2026
Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez
Häftad, 2026
932 kr
- Nyhet
Electronic Participation
David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek
Häftad, 2026
730 kr
Du kanske också är intresserad av
- 10% rabatt på allt
Automata, Languages, and Programming
Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska, David Peleg
Häftad, 2013
572 kr
Automata, Languages and Programming
Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
Häftad, 2006
1 137 kr
Automata, Languages and Programming
Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
Häftad, 2009
1 104 kr
Automata, Languages and Programming
Andrzej Lingas, Rolf Karlsson, Svante Carlsson
Häftad, 1993
1 137 kr
Automata, Languages and Programming
Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
Häftad, 1997
1 137 kr