Cantitate/Preț
Produs

Relational and Algebraic Methods in Computer Science: Lecture Notes in Computer Science, cartea 10226

Editat de Peter Höfner, Damien Pous, Georg Struth
en Limba Engleză Paperback – 25 apr 2017
This book constitutes the proceedings of the 16th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2017, held in Lyon, France, in May 2017. The 17 revised full papers and 2 invited papers presented together with 1 invited abstract were carefully selected from 28 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.
 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32422 lei

Preț vechi: 40527 lei
-20%

Puncte Express: 486

Preț estimativ în valută:
5733 6574$ 4955£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai


Specificații

ISBN-13: 9783319574172
ISBN-10: 3319574175
Pagini: 340
Ilustrații: XIV, 323 p. 24 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Algebra for Quantitative Information Flow.- Dual space of a lattice as the completion of a Pervin space.- Images as relations under RelView.- Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces.- Varieties of Cubical Sets.- Non-Associative Kleene Algebra and Temporal Logics.- Algebraic Investigation of Connected Components.- Stone Relation Algebras.- Relation algebras, idempotent semirings and generalized bunched implication algebras.- Parsing and Printing of and with Triples.- Software Development in Relation Algebra with Ampersand.- Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras.- Aggregation of Votes with Multiple Positions on Each Issue.- Complete solution of an optimization problem in tropical semifield.- Concurrency-Preserving Minimal Process Representation.- Embeddability into relational lattices is undecibable.- Tower Induction and Up-To Techniques for CCS with Fixed Points.- Reasoning aboutCardinalities of Relations with Applications Supported by Proof Assistants.- Type-n Arrow Categories.

Caracteristici

Includes supplementary material: sn.pub/extras Includes supplementary material: sn.pub/extras