Mathematical Foundations of Computer Science 1978: 7th Symposium Zakopane, Poland, September 4-8, 1978. Proceedings: Lecture Notes in Computer Science, cartea 64
Editat de J. Winkowskien Limba Engleză Paperback – aug 1978
Din seria Lecture Notes in Computer Science
- 20% Preț: 1005.39 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.19 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 15% Preț: 549.86 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 548.74 lei
- 20% Preț: 172.69 lei
- 20% Preț: 611.22 lei
- 20% Preț: 970.25 lei
- 20% Preț: 552.64 lei
- 20% Preț: 315.78 lei
- 20% Preț: 315.78 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 20% Preț: 1018.35 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 327.61 lei
Preț vechi: 409.51 lei
-20% Nou
Puncte Express: 491
Preț estimativ în valută:
62.75€ • 68.03$ • 52.16£
62.75€ • 68.03$ • 52.16£
Carte tipărită la comandă
Livrare economică 02-16 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540089216
ISBN-10: 3540089217
Pagini: 568
Ilustrații: IX, 556 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1978
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540089217
Pagini: 568
Ilustrații: IX, 556 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1978
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
The connection between modal logic and algorithmic logics.- The algebraic semantics of recursive program schemes.- Finding the correctness proof of a concurrent program.- An algebra for parallelism based on petri nets.- Data types as functions.- Synthesis of communicating behaviour.- Programming languages as mathematical objects.- Writing and verifying sequential files updating programs.- On the completeness of query languages for relational data bases.- Mastering contextsensitivity in programming languages.- Decision problems concerning parallel programming.- Attribute grammars and two-level grammars: A unifying approach.- Extensions and implementations of abstract data type specifications.- Concurrency of manipulations in multidimensional information structures.- Deriving structures from structures.- Semantics of nondeterminism, concurrency and communication.- Contribution to the theory of concurrency in databases.- Facts in place/transition-nets.- Loop programs and classes of primitive recursive functions.- Dynamic theories of real and complex numbers.- Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication.- Some applications of algebraic semantics.- Goal-oriented derivation of logic programs.- Transforming recursion equations to algorithms.- Structural invariants for some classes of structured programs.- Synthesis of concurrent schemes.- Fast matrix multiplication by boolean RAM in linear storage.- Cycles of partial orders.- Complexity measures defined by mazurkiewicz-algorithms.- On functional grammars.- Analysis of a universal class of hash functions.- A framework for producing deterministic canonical bottom-up parsers.- Cooperating grammar systems.- Synchronized petri nets : A model for the description of non-autonomous sytems.- On divergence and halting problems for monadic program schemas.- Compression of clustered inverted files.- The completeness of propositional dynamic logic.- Improving memory utilization in transforming recursive programs.- On two subclasses of real-time grammars.- On information storage and retrieval systems an algebraic approach, part 1.- Probabilistic LCF.- On algorithmic theory of stacks.- Analyzing program solutions of coordination problems by cp-nets.- Structural properties of petri nets.- Ensuring correctness by arbitrary postfixed-points.- String-matching in real time: Some properties of the data structure.- Name independence and database abstraction in the relational model.- Free Petri net languages.- Transformations to produce certain covering grammars.- On the computational power of extended petri nets.- Theory of relations for databases — a tutorial survey.