Machines, Computations, and Universality: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings: Lecture Notes in Computer Science, cartea 2055
Editat de Maurice Margenstern, Yurii Rogozhinen Limba Engleză Paperback – 9 mai 2001
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 332.42 lei
Preț vechi: 415.53 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
58.81€ • 69.14$ • 51.51£
58.81€ • 69.14$ • 51.51£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540421214
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.78 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.78 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures Notes.- Three Small Universal Turing Machines.- Computation in Gene Networks.- Power, Puzzles and Properties of Entanglement.- Combinatorial and Computational Problems on Finite Sets of Words.- Computing with Membranes (P Systems): Universality Results.- A Simple Universal Logic Element and Cellular Automata for Reversible Computing.- Some Applications of the Decidability of DPDA’s Equivalence.- The Equivalence Problem for Computational Models: Decidable and Undecidable Cases.- Two Normal Forms for Rewriting P Systems.- Technical Contributions.- On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations.- On the Transition Graphs of Turing Machines.- JC-Nets.- JC-Nets.- Nonterminal Complexity of Programmed Grammars.- Nonterminal Complexity of Programmed Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- A Direct Construction of a Universal Extended H System.- A Direct Construction of a Universal Extended H System.- Speeding-Up Cellular Automata by Alternations.- Speeding-Up Cellular Automata by Alternations.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- P Systems with Membrane Creation: Universality and Efficiency.- P Systems with Membrane Creation: Universality and Efficiency.- On the Computational Power of a Continuous-space Optical Model of Computation.- On theComputational Power of a Continuous-space Optical Model of Computation.- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- D0L System + Watson-Crick Complementarity = Universal Computation.- D0L System + Watson-Crick Complementarity = Universal Computation.
Caracteristici
Includes supplementary material: sn.pub/extras