Foundations of Software Science and Computation Structures
Editat de Maurice Nivaten Limba Engleză Paperback – 11 mar 1998
The 19 revised full papers presented in the book were carefully selected from a total of 44 submissions. Among the topics covered are formal specification, automata theory, term rewriting and rewriting systems, process algebras, formal language theory, type theory, event structures, and iteration theory.
Preț: 322.59 lei
Preț vechi: 403.23 lei
-20%
Puncte Express: 484
Carte tipărită la comandă
Livrare economică 15-29 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 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: 9783540643005
ISBN-10: 3540643001
Pagini: 308
Ilustrații: XI, 297 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.47 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540643001
Pagini: 308
Ilustrații: XI, 297 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.47 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Generalizing domain theory.- A cook's tour of equational axiomatizations for prefix iteration.- The WHILE hierarchy of program schemes is infinite.- Analysis of a guard condition in type theory.- An event structure semantics for P/T contextual nets: Asymmetric event structures.- Pumping Lemmas for timed automata.- Asynchronous Observations of Processes.- Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling.- Partial metrics and co-continuous valuations.- Mobile ambients.- Rational term rewriting.- The appearance of big integers in exact real arithmetic based on Linear Fractional Transformations.- Net refinement by pullback rewriting.- On piecewise testable, starfree, and recognizable picture languages.- Functor categories and two-level languages.- Deciding properties for message sequence charts.- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.- Deterministic rational transducers and random sequences.- Resource based models for asynchrony.