%A E.G. Wagner %T A categorical treatment of pre- and post conditions %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 1-5 %A R. Cori %A S. Dulucq %T Colourings of planar maps and the equality of two languages %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 6-16 %A J. Beauquier %A B. Berard %T On the equivalence of synchronization sets %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 17-29 %A F. Parisi-Presicce %T Inner and mutual compatibility of basic operations on module specifications %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 30-44 %A A. Pelin %A J.H. Gallier %T Exact computation sequences %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 45-59 %A G. Stefanescu %T An algebraic theory of flowchart schemes %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 60-73 %A M. Bauderon %A B. Courcelle %T An algebraic formalism for graphs %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 74-84 %A E. Dahlhaus %A M.K. Warmuth %T Membership for growing context sensitive grammars is polynomial %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 85-99 %A Ph. Devienne %A P. Lebegue %T Weighted graphs: a tool for logic programming %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 100-111 %A G. File %T Classical and incremental evaluators for attribute grammars %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 112-126 %A A. Pettorossi %T Transformation strategies for deriving on line programs %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 127-141 %A D. Frutos Escrig %T Probabilitistic Ianov's schemes %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 142-157 %A K. Salomaa %T Alternating bottom-up tree recognizers %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 158-171 %A R. Casas %A J.M. Steyaert %T Bottom-up recursion in trees %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 172-182 %A H. Vogler %T Basic tree transducers %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 183-195 %A Ph. Jacquet %A M. Regnier %T Trie partitioning process: limiting distributions %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 196-210 %A G. Louchard %T Random walks, gaussian processes, and list structures %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 211-224 %A R. Schott %T Random walks on trees %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 225-237 %A R. Rinat %A N. Francez %T O. Grumberg %T Infinite trees, markings and well foundedness %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 238-253 %A E. Dahlhaus %A J.A. Makowsky %T Computable directory queries %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 254-265 %A A. Asperti %A G. Longo %T Relating type-structures: partial variations on a theme of Friedman and Statman %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 266-287 %A G. Mirkowska %A A. Salwicki %T On applications of algorithmic logic %J Proceedings of the 11th Colloquium on Trees in Algebra and Programming %C Nice, France %D March 1986 %E P. Franchi-Zannettacci %O published as Lecture Notes in Computer Science 214 by Springer-Verlag %K caap caap11 %P 288-306