CAAP '86 [electronic resource] : 11th Colloquium on Trees in Algebra and Programming Nice, France, March 24–26, 1986 Proceedings / edited by Paul Franchi-Zannettacci.

By: Franchi-Zannettacci, Paul [editor.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 214Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: X, 310 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540397830Subject(s): Computer science | Computer software | Logic design | Computer Science | Computation by Abstract Devices | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha