CAAP'86: 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings

Author:   Paul Franchi-Zannettacci
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1986 ed.
Volume:   214
ISBN:  

9783540164432


Pages:   308
Publication Date:   01 March 1986
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $166.19 Quantity:  
Add to Cart

Share |

CAAP'86: 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings


Overview

Full Product Details

Author:   Paul Franchi-Zannettacci
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1986 ed.
Volume:   214
Dimensions:   Width: 15.50cm , Height: 1.60cm , Length: 23.50cm
Weight:   0.980kg
ISBN:  

9783540164432


ISBN 10:   354016443
Pages:   308
Publication Date:   01 March 1986
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

A categorical treatment of pre- and post- conditions.- Colourings of planar maps and the equality of two languages.- On the equivalence of synchronization sets.- Inner and mutual compatibility of basic operations on module specifications.- Exact computation sequences.- An algebraic theory of flowchart schemes.- An algebraic formalism for graphs.- Membership for growing context sensitive grammars is polynomial.- Weighted graphs : A tool for logic programming.- Classical and incremental evaluators for attribute grammars.- Transformation strategies for deriving on line programs.- Probabilistic Ianov's schemes.- Alternating bottom-up tree recognizers.- Bottom-up recursion in trees.- Basic tree transducers.- Trie partitioning process: Limiting distributions.- Random walks, gaussian processes and list structures.- Random walks on trees.- Infinite trees, markings and well foundedness.- Computable directory queries.- Relating type-structures partial variations on a theme of Friedman and Statman.- On applications of algorithmic logic.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List