Out of Print
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
The international Colloquium on Trees in Algebra and Programming is an annual conference on Theoretical Computer Science. Its central theme is the algebraic and combinatorial properties of trees, graphs and other combinatorial objects that appear in many different fields of computer science. These include formal languages and automata, rewriting systems, complexity and validity of algorithms and programs, program schemes, concurrent processes, databases, data structures, specification methods, models of lambda-calculus, VLSI circuits and semantics of programming languages. However, trees and graphs have such a wide range of uses in computer science that no aspect is excluded. This book contains the twenty-two communications of the ninth colloquium held in Bordeaux, France in March 1984. Of these, three invited papers survey existing work in three different fields and nineteen present new results.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: September 1984
- format: Hardback
- isbn: 9780521267502
- length: 333 pages
- dimensions: 228 x 152 x 24 mm
- weight: 0.6kg
- availability: Unavailable - out of print May 1992
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×