Trees in Algebra and Programming - CAAP '94
Editat de Sophie Tisonen Limba Engleză Paperback – 23 mar 1994
Preț: 325.83 lei
Preț vechi: 407.29 lei
-20%
Puncte Express: 489
Preț estimativ în valută:
57.62€ • 66.07$ • 49.80£
57.62€ • 66.07$ • 49.80£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540578796
ISBN-10: 354057879X
Pagini: 372
Ilustrații: XI, 361 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354057879X
Pagini: 372
Ilustrații: XI, 361 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Ordering constraints on trees.- Graph grammars and tree transducers.- Type Preorders.- Compilative constructive negation in constraint logic programs.- A new linear algorithm for Modular Decomposition.- A CPS-translation of the ??-calculus.- A lower bound on the growth of functions computed by tree transductions.- On the decidability of model checking for several ?-calculi and Petri nets.- Generalizations of the periodicity theorem of Fine and Wilf.- Probabilistic domains.- Some results on top-context-free tree languages.- On higher order recursive program schemes.- Graphs and decidable transductions based on edge constraints.- Nondeterministic automata with concurrency relations and domains.- Algebraic and combinatorial properties of simple, coloured walks.- Probabilistic analysis of an election algorithm in a tree.- On the first-order equivalence of call-by-name and call-by-value.- On the modularity of confluence of constructor-sharing term rewriting systems.- Global program analysis in constraint form.- On projective and separable properties.- A rank hierarchy for deterministic tree-walking transducers.- Superposition in picture languages.- A grammar-based data-flow analysis to stop deforestation.