Cantitate/Preț
Produs

Relational Methods in Computer Science: 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers: Lecture Notes in Computer Science, cartea 3929

Editat de Wendy MacCaull, Michael Winter, Ivo Düntsch
en Limba Engleză Paperback – 18 apr 2006

Din seria Lecture Notes in Computer Science

Preț: 31897 lei

Preț vechi: 39871 lei
-20%

Puncte Express: 478

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783540333395
ISBN-10: 3540333398
Pagini: 278
Ilustrații: VIII, 262 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.4 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- Topological Representation of Precontact Algebras.- Relational Semantics Through Duality.- Duality Theory for Projective Algebras.- Contributed Papers.- Relational Approach to Boolean Logic Problems.- Static Analysis of Programs Using Omega Algebra with Tests.- Weak Contact Structures.- On Relational Cycles.- A Framework for Kleene Algebra with an Embedded Structure.- Non-termination in Unifying Theories of Programming.- Towards an Algebra of Hybrid Systems.- Relational Correspondences for Lattices with Operators.- Control-Flow Semantics for Assembly-Level Data-Flow Graphs.- Relational Implementation of Simple Parallel Evolutionary Algorithms.- Lattice-Based Paraconsistent Logic.- Verification of Pushdown Systems Using Omega Algebra with Domain.- wp Is wlp.- Relational Representability for Algebras of Substructural Logics.- Knuth-Bendix Completion as a Data Structure.- Quantifier Elimination in Elementary Set Theory.- Time-Dependent Contact Structures in Goguen Categories.