Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

CAAP '90

Name: CAAP '90
Brand: Springer, Berlin
SKU: 05274144
Price: 21133 HUF
Availability: InStock
Author: Andre Arnold
ISBN: 9783540525905

15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings

Andre Arnold

Language

English

Book Paperback

Libristo code: 05274144

Publishers Springer, Berlin, April 1990

This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming... Full description

Libristo code: 05274144

145 b

21 133 Ft

Low in stock at our supplier Shipping in 11-15 days

Up to 30 days for returns

Customers also purchased

Puente al Español - Ausgabe 2012

Sheet

8 428 Ft

EatSmarter! Low-Carb-Rezepte für das Abendessen EatSmarter!

Paperback

3 332 Ft

This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in computer science, including syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of trees and graphs.