Fontet M (11 results)

Condition: New. In English.

Condition: New.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Key-problems and key-methods in computational geometry.- Some recent results on squarefree words.- Transformations realizing fairness assumptions for parallel programs.- Computing the largest empty rectangle.- Approximation schemes for covering and packing problems in robotics and vlsi.- Covering polygons with minimum number of rectangles.- On expressive interpretations of a Hoare-logic for Clarke's language L4.- Towards executable specifications using conditional axioms.- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.- On a general weight of trees.- From expanders to better superconcentrators without cascading.- Locally synchronous complexity in the light of the trans-box method.- A new definition of morphism on Petri nets.- Blocage et vivacité dans les réseaux a pile-file.- Denotational semantics of concurrent programs with shared memory.- Higher order data structures.- Computability in higher types and the universal domain P .- On the structure of polynomial time degrees.- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region.- Efficient simulations among several models of parallel computers (extended abstract).- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres.- Adherence equivalence is decidable for DOL languages.- Pusdown space complexity and related full-A.F.L.s.- Automates a pile sur des alphabets infinis.- Logic programs and many-valued logic.- Algebre de machines et logique temporelle.- Algebraic and topological theory of languages and computation.- A property of three-element codes.- Polynomial time inference of general pattern languages.- On extendibility of unavoidable sets. …

Condition: New. Sponsored by AFCET (Association Francaise pour la Cybern&AAetique Economique et Technique) and GI (Gesellschaft fuer Informatik)Key-problems and key-methods in computational geometry.- Some recent results on squarefree words.- Transformations reali.

Taschenbuch. Condition: Neu. STACS 84 | Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984 | M. Fontet (u. a.) | Taschenbuch | viii | Englisch | 1984 | Springer | EAN 9783540129202 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Paperback. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

(Anglais). Condition: Etat satisfaisant. Langue : Anglais, Français Nb de volumes : 1.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Key-problems and key-methods in computational geometry.- Some recent results on squarefree words.- Transformations realizing fairness assumptions for parallel programs.- Computing the largest empty rectangle.- Approximation schemes for covering and packing problems in robotics and vlsi.- Covering polygons with minimum number of rectangles.- On expressive interpretations of a Hoare-logic for Clarke's language L4.- Towards executable specifications using conditional axioms.- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.- On a general weight of trees.- From expanders to better superconcentrators without cascading.- Locally synchronous complexity in the light of the trans-box method.- A new definition of morphism on Petri nets.- Blocage et vivacité dans les réseaux a pile-file.- Denotational semantics of concurrent programs with shared memory.- Higher order data structures.- Computability in higher types and the universal domain P .- On the structure of polynomial time degrees.- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region.- Efficient simulations among several models of parallel computers (extended abstract).- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres.- Adherence equivalence is decidable for DOL languages.- Pusdown space complexity and related full-A.F.L.s.- Automates a pile sur des alphabets infinis.- Logic programs and many-valued logic.- Algebre de machines et logique temporelle.- Algebraic and topological theory of languages and computation.- A property of three-element codes.- Polynomial time inference of general pattern languages.- On extendibility of unavoidable sets. 348 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Key-problems and key-methods in computational geometry.- Some recent results on squarefree words.- Transformations realizing fairness assumptions for parallel programs.- Computing the largest empty rectangle.- Approximation schemes for covering and packing problems in robotics and vlsi.- Covering polygons with minimum number of rectangles.- On expressive interpretations of a Hoare-logic for Clarke's language L4.- Towards executable specifications using conditional axioms.- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.- On a general weight of trees.- From expanders to better superconcentrators without cascading.- Locally synchronous complexity in the light of the trans-box method.- A new definition of morphism on Petri nets.- Blocage et vivacité dans les réseaux a pile-file.- Denotational semantics of concurrent programs with shared memory.- Higher order data structures.- Computability in higher types and the universal domain P .- On the structure of polynomial time degrees.- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region.- Efficient simulations among several models of parallel computers (extended abstract).- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres.- Adherence equivalence is decidable for DOL languages.- Pusdown space complexity and related full-A.F.L.s.- Automates a pile sur des alphabets infinis.- Logic programs and many-valued logic.- Algebre de machines et logique temporelle.- Algebraic and topological theory of languages and computation.- A property of three-element codes.- Polynomial time inference of general pattern languages.- On extendibility of unavoidable sets.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 348 pp. Englisch.…