Automata, Languages and Programming: 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings: Lecture Notes in Computer Science, cartea 372
Editat de Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Roccaen Limba Engleză Paperback – 28 iun 1989
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ț: 634.98 lei
Preț vechi: 793.73 lei
-20% Nou
Puncte Express: 952
Preț estimativ în valută:
121.60€ • 131.59$ • 101.37£
121.60€ • 131.59$ • 101.37£
Carte tipărită la comandă
Livrare economică 09-23 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540513711
ISBN-10: 354051371X
Pagini: 804
Ilustrații: XIV, 790 p.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.1 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354051371X
Pagini: 804
Ilustrații: XIV, 790 p.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.1 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Realizable and unrealizable specifications of reactive systems.- Limitations of the upward separation technique (preliminary version).- Lower bounds for the low hierarchy.- Efficient text searching of regular expressions.- Factors of words.- Asymptotically optimal distributed consensus.- Time lower bounds for CREW-PRAM computation of monotone functions.- Subduing self-application.- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds.- Polymorphic rewriting conserves algebraic strong normalization and confluence.- Completion of finite codes with finite deciphering delay.- Relational semantics for recursive types and bounded quantification.- A singly-exponential stratification scheme for real semi-algebraic varieties and its applications.- About primitive recursive algorithms.- The definability of equational graphs in monadic second-order logic.- Dominoes and the regularity of DNA splicing languages.- Causal trees.- Infinite normal forms.- On recent trends in algebraic specification.- Automata with storage on infinite words.- Parallel algorithmic techniques for combinatorial computation.- On dice and coins: models of computation for random generation.- An optimal probabilistic algorithm for synchronous Byzantine agreement.- Finding triconnected components by local replacements.- An improved algorithm for approximate string matching.- A pointer-free data structure for merging heaps and min-max heaps.- Structured operational semantics and bisimulation as a congruence.- Parallel retrieval of scattered information.- Tensor rank is NP-complete.- The complexity of nonlinear separable optimization.- General methods for the analysis of the maximum size of dynamic data structures.- How to share concurrent asynchronous wait-free variables.- A newapproach to formal language theory by kolmogorov complexity.- Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis.- Completing the temporal picture.- Lower bounds for computations with the floor operation.- Programming, transforming, and proving with function abstractions and memories.- Automata theory meets circuit complexity.- Two versus one index register and modifiable versus non-modifiable programs.- Shortest paths without a map.- Modular system design applying graph grammars techniques.- Partial communations.- On the synthesis of an asynchronous reactive module.- The complexity of controlled selection.- Memory versus randomization in on-line algorithms.- Syntactic control of interference Part 2.- Characteristic formulae.- A combinatorial technique for separating counting complexity classes.- Horn programs and semicomputable relations on abstract structures.- A note on model checking the modal v-calculus.- DI-domains as information systems.