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

By: Franchi-Zannettacci, P. (Paul)
Contributor(s): Franchi-Zannettacci, P. (Paul) [editor.]
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 214.Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: 1 online resource (VI, 306 pages .)Content type: text Media type: computer Carrier type: online resourceISBN: 9783540397830; 3540397833; 354016443X; 9783540164432Subject(s): Computer software | Logic design | Computer science | Computers | Algorithms | Computer logic | Logic, Symbolic and mathematical | Algebra | Logic, Symbolic and mathematical | Computers | Computer logic | Algorithms | Algebra | Computer science | Computer software | Logic designGenre/Form: Electronic books. Additional physical formats: Print version: 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 e-books
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

English.

There are no comments for this item.

to post a comment.

Powered by Koha