CAAP '88
Editat de Max Dauchet, Maurice Nivaten Limba Engleză Paperback – 9 mar 1988
Preț: 322.99 lei
Preț vechi: 403.74 lei
-20%
Puncte Express: 484
Preț estimativ în valută:
57.11€ • 65.49$ • 49.36£
57.11€ • 65.49$ • 49.36£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540190219
ISBN-10: 354019021X
Pagini: 316
Ilustrații: VIII, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354019021X
Pagini: 316
Ilustrații: VIII, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A tree pattern matching algorithm with reasonable space requirements.- On the maximum path length of AVL trees.- Decomposition trees: Structured graph representation and efficient algorithms.- On counting and approximation.- Parameter-reduction of higher level grammars.- Analysis of dynamic algorithms in D.E.Knuth's model.- On completeness of narrowing strategies.- Implementing term rewrite languages in Dactl.- Unification in primal algebras.- Algebraic specification with built-in domain constructions.- Product and iteration of module specifications.- Equational completion in order-sorted algebras extended abstract.- Proving systolic arrays.- Expressiveness bounds for completeness in trace-based network proof systems.- Proof systems for Hennessy-Milner Logic with recursion.- Regular automata and model checking.- Interval logics and sequential transducers.- A2CCS: A simple extension of CCS for handling atomic actions.- Modelling statecharts behaviour in a fully abstract way.- Directed hypergraphs: Data structures and applications.