Proceedings. CAAP '86 / 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24 - 26, 1986. Ed. by P. Franchi-Zannettacci, Lecture notes in computer science

Franchi-Zannettacci, Paul:

ISBN 10: 354016443X / ISBN 13: 9783540164432

Editore: Berlin , Heidelberg , New York , Tokyo : Springer, 1986

Riguardo questo articolo

VI, 306 S. , 25 cm Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand, Literaturangaben Sprache: Englisch Gewicht in Gramm: 550.

Codice articolo 182914

Dati bibliografici

• Titolo: Proceedings. CAAP '86 / 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24 - 26, 1986. Ed. by P. Franchi-Zannettacci, Lecture notes in computer science
• Editore: Berlin , Heidelberg , New York , Tokyo : Springer
• Data di pubblicazione: 1986
• Lingua: Inglese
• ISBN 10: 354016443X
• ISBN 13: 9783540164432
• Rilegatura: kart.
• Condizione: Gut
• Peso: 550 grammi
• Cataloghi dei venditori:
  • Alle Bücher

Descrizione articolo

Contenuti

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.