Theoretical Computer Science 4th (49 results)

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in nice condition with the usual markings and attachments.

Cloth. Condition: Good+. Retired Colorado College Library copy with usual stamps, penciled markings, and rear pocket. Else clean and tight textblock. Library stamped top edge. Very lightly shelf worn binding. 324pp. Size: 8vo - over 7¾" - 9¾" tall. Mathematics/Graphs, Drawings (illustrator). Ex-Library Hardcover. …

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Paperback. Condition: Very Good. No Dust Jacket. Lecture Notes in Computer Science 281. Ex Library. Ink stamp and previous owner's sticker on the front cover. Library catalogue sticker on colophon. Traces of sticker residue across spine foot; faintly bumped spine head and rubbed corners. Spine face and foot of page block slightly grubby and marked due to age. Sound, clean book with strong binding and bright text. ADG. Ex-Library.…

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Condition: Good. Some shelfwear; extremities are a little worn. Edges slightly upturned in places. Content of the book is mostly clean throughout, though ink inscription and some staining in places. A readable paperback.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: New. In English.

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.…

Condition: New.

Condition: New. In English.

Condition: New.

Condition: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

PF. Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New. 1st ed. 2019 edition NO-PA16APR2015-KAP.

Condition: New. In English.

Condition: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Softcover Sehr gut erhalten.

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in processalgebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.…

Paperback. Condition: Brand New. revised edition. 256 pages. 9.00x6.00x0.50 inches. In Stock.