Coverart for item
The Resource Machines, computations, and universality : third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings, Maurice Margenstern, Yurii Rogozhin (eds.)

Machines, computations, and universality : third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings, Maurice Margenstern, Yurii Rogozhin (eds.)

Label
Machines, computations, and universality : third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings
Title
Machines, computations, and universality
Title remainder
third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings
Statement of responsibility
Maurice Margenstern, Yurii Rogozhin (eds.)
Title variation
MCU 2001
Creator
Contributor
Subject
Genre
Language
eng
Member of
Additional physical form
Also available via the World Wide Web. Abstracts available without subscription.
Cataloging source
UKM
Dewey number
005.131
Illustrations
illustrations
Index
index present
LC call number
QA267
LC item number
.M33 2001
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2001
http://bibfra.me/vocab/lite/meetingName
MCU 2001
http://library.link/vocab/relatedWorkOrContributorName
  • Margenstern, Maurice
  • Rogozhin, Yurii
Series statement
Lecture notes in computer science,
Series volume
2055
http://library.link/vocab/subjectName
  • Machine theory
  • Computer programming
  • Algorithms
  • Ordinateurs moléculaires
  • Ordinateurs quantiques
  • Automates cellulaires
  • Automates mathématiques, Théorie des
Label
Machines, computations, and universality : third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings, Maurice Margenstern, Yurii Rogozhin (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Computing with membranes (P systems): universality results
  • Carlos Martín-Vide Gheorghe Pǎun
  • Simple universal logic element and cellular automata for reversible computing
  • Kenichi Morita
  • Some applications of the decidability of DPDA's equivalence
  • Géraud Sénizergues
  • Equivalence problem for computational models: decidable and undecidable cases
  • Vladimir A. Zakharov
  • Two normal forms for rewriting P systems
  • Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
  • Three small universal turing machines
  • Technical contributions
  • On a conjecture of kůrka. A turning machine with no periodic configurations
  • Vicent D. Blondel, Julien Cassaigne, Codrin Nichitiu
  • On the transition graphs of turning machines
  • Didier Caucal
  • JC-nets
  • Gabriel Ciobanu, Mihai Rotaru
  • Nonterminal complexity of progreammed grammars
  • Henning Fernau
  • On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars
  • Claudio Baiocchi
  • Rudolf Freund, Gheorghe Pǎun
  • Direct construction of a universal extended H system
  • Pierluigi Frisco
  • Speeding-up cellular automata by alternations
  • Chuzo Iwamoto ... [et al.]
  • Efficient universal pushdown cellular automata and their application to complexity
  • Martin Kutrib
  • Firing squad synchronization problem on didimensional cellular automata with communication constraints
  • Salvatore La Torre, Margherita Napoli, Mimmo Parente
  • P systems with membrane creation: university and efficiency
  • Computation in gene networks
  • Madhu Mutyam, Kamala K. Krithivasan
  • On the computational power of a continuous-space optical model of computation
  • Thomas J. Naughton, Damien Woods
  • On a P-optimal proof system for the set of all satishiable boolean formulas {SAT}
  • Zenon Sadowski
  • DOL system + watson-crick complementarity=universal computation
  • Petr Sosík
  • Asa Ben-Hur, Hava, T. Siegelmann
  • Power, puzzles and properties of entanglement
  • Jozef Gruska, Hiroshi Imai
  • Combinatorial and computational problems on finite sets of words
  • Juhani Karhumäki
Control code
47119191
Dimensions
24 cm
Extent
viii, 319 pages
Isbn
9783540421214
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Label
Machines, computations, and universality : third international conference, MCU 2001, Chişinǎu, Moldova, May 23-27, 2001 : proceedings, Maurice Margenstern, Yurii Rogozhin (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Computing with membranes (P systems): universality results
  • Carlos Martín-Vide Gheorghe Pǎun
  • Simple universal logic element and cellular automata for reversible computing
  • Kenichi Morita
  • Some applications of the decidability of DPDA's equivalence
  • Géraud Sénizergues
  • Equivalence problem for computational models: decidable and undecidable cases
  • Vladimir A. Zakharov
  • Two normal forms for rewriting P systems
  • Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
  • Three small universal turing machines
  • Technical contributions
  • On a conjecture of kůrka. A turning machine with no periodic configurations
  • Vicent D. Blondel, Julien Cassaigne, Codrin Nichitiu
  • On the transition graphs of turning machines
  • Didier Caucal
  • JC-nets
  • Gabriel Ciobanu, Mihai Rotaru
  • Nonterminal complexity of progreammed grammars
  • Henning Fernau
  • On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars
  • Claudio Baiocchi
  • Rudolf Freund, Gheorghe Pǎun
  • Direct construction of a universal extended H system
  • Pierluigi Frisco
  • Speeding-up cellular automata by alternations
  • Chuzo Iwamoto ... [et al.]
  • Efficient universal pushdown cellular automata and their application to complexity
  • Martin Kutrib
  • Firing squad synchronization problem on didimensional cellular automata with communication constraints
  • Salvatore La Torre, Margherita Napoli, Mimmo Parente
  • P systems with membrane creation: university and efficiency
  • Computation in gene networks
  • Madhu Mutyam, Kamala K. Krithivasan
  • On the computational power of a continuous-space optical model of computation
  • Thomas J. Naughton, Damien Woods
  • On a P-optimal proof system for the set of all satishiable boolean formulas {SAT}
  • Zenon Sadowski
  • DOL system + watson-crick complementarity=universal computation
  • Petr Sosík
  • Asa Ben-Hur, Hava, T. Siegelmann
  • Power, puzzles and properties of entanglement
  • Jozef Gruska, Hiroshi Imai
  • Combinatorial and computational problems on finite sets of words
  • Juhani Karhumäki
Control code
47119191
Dimensions
24 cm
Extent
viii, 319 pages
Isbn
9783540421214
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107
Processing Feedback ...