CAAP '86 : 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, proceedings
著者
書誌事項
CAAP '86 : 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, proceedings
（Lecture notes in computer science, 214）
Springer-Verlag, c1986
- : gw
- : us
大学図書館所蔵 件 / 全61件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
内容説明・目次
目次
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.
「Nielsen BookData」 より