Machines, Computations, and Universality: Third International Conference, McU 2001 Chisinau, Moldova, May 23-27, 2001 : Proceedings,9783540421214

Machines, Computations, and Universality: Third International Conference, McU 2001 Chisinau, Moldova, May 23-27, 2001 : Proceedings

by ; ; ; ;
ISBN13: 9783540421214
ISBN10: 3540421211
Format: Paperback
Pub. Date: 2001-06-01
Publisher(s): Springer Verlag
List Price: $99.00

Rent Textbook

Select for Price
Add to Cart
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:30 Days access
Downloadable:30 Days
$19.80
Online:60 Days access
Downloadable:60 Days
$26.40
Online:90 Days access
Downloadable:90 Days
$33.00
Online:120 Days access
Downloadable:120 Days
$39.60
Online:180 Days access
Downloadable:180 Days
$42.90
Online:1825 Days access
Downloadable:Lifetime Access
$65.99
*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.
$42.90*
Add to Cart

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

Buy from our Marketplace starting at $8.79

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

This book constitutes the refereed proceedings of the Third International Conference on Machines, Computations, and Universality, MCU 2001, held in Chisinau, Moldavia, in May 2001.The book presents nine invited papers together with 13 revised refereed papers selected during a thorough round of reviewing. Among the topics covered are cellular automata, molecular computing, quantum computing, formal languages and automata theory, and computational complexity.

Table of Contents

Invited Lectures
Three Small Universal Turing Machines
1(10)
Claudio Baiocchi
Computation in Gene Networks
11(14)
Asa Ben-Hur
Hava T. Siegelmann
Power, Puzzles and Properties of Entanglement
25(44)
Jozef Gruska
Hiroshi Imai
Combinatorial and Computational Problems on Finite Sets of Words
69(13)
Juhani Karhumaki
Computing With Membranes (P Systems): Universality Results
82(20)
Carlos Martin-Vide
Gheorghe Paun
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
102(12)
Kenichi Morita
Some Applications of the Decidability of DPDA's Equivalence
114(19)
Geraud Senizergues
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
133(20)
Vladimir A. Zakharov
Two Normal Forms for Rewriting P Systems
153(12)
Claudio Zandron
Claudio Ferretti
Giancarlo Mauri
Technical Contributions
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations
165(12)
Vincent D. Blondel
Julien Cassaigne
Codrin Nichitiu
On the Transition Graphs of Turing Machines
177(13)
Didier Caucal
JC-Nets
190(12)
Gabriel Ciobanu
Mihai Rotaru
Nonterminal Complexity of Programmed Grammars
202(12)
Henning Fernau
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
214(12)
Rudolf Freund
Gheorghe Paun
A Direct Construction of a Universal Extended H System
226(14)
Pierluigi Frisco
Speeding-Up Cellular Automata by Alternations
240(12)
Chuzo Iwamoto
Katsuyuki Tateishi
Kenichi Morita
Katsunobu Imai
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
252(12)
Martin Kutrib
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
264(12)
Salvatore La Torre
Margherita Napoli
Mimmo Parente
P Systems with Membrane Creation: Universality and Efficiency
276(12)
Madhu Mutyam
Kamala Krithivasan
On the Computational Power of a Continuous-Space Optical Model of Computation
288(12)
Thomas J. Naughton
Damien Woods
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
300(8)
Zenon Sadowski
DOL System + Watson-Crick Complementarity=Universal Computation
308(13)
Petr Sosik
Author Index 321

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.