default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. MCU 2004: Saint Petersburg, Russia
- Maurice Margenstern:
Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3354, Springer 2005, ISBN 3-540-25261-4
Invited Lectures
- Cristian Calude:
Algorithmic Randomness, Quantum Physics, and Incompleteness. 1-17 - Alain Colmerauer:
On the Complexity of Universal Programs. 18-35 - Juhani Karhumäki:
Finite Sets of Words and Computing. 36-49 - Klaus Sutner:
Universality and Cellular Automata. 50-59 - Klaus W. Wagner:
Leaf Language Classes. 60-81
Selected Contributions
- Artiom Alhazov
, Rudolf Freund, Gheorghe Paun:
Computational Completeness of P Systems with Active Membranes and Two Polarizations. 82-92 - Stefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone:
Computing with a Distributed Reaction-Diffusion Model. 93-103 - Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel:
Computational Universality in Symbolic Dynamical Systems. 104-115 - Olivier Bournez, Emmanuel Hainry:
Real Recursive Functions and Real Extensions of Recursive Functions. 116-127 - Giusi Castiglione, Antonio Restivo:
Ordering and Convex Polyominoes. 128-139 - Gianpiero Cattaneo, Alberto Dennunzio:
Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages. 140-152 - Matteo Cavaliere, Peter Leupold:
Evolution and Observation: A Non-standard Way to Accept Formal Languages. 153-163 - Jerzy Mycka, José Félix Costa:
The Computational Power of Continuous Dynamic Systems. 164-175 - Jérôme Durand-Lose:
Abstract Geometrical Computation for Black Hole Computation. 176-187 - Kellie Michele Evans:
Is Bosco's Rule Universal? 188-199 - Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron:
Sequential P Systems with Unit Rules and Energy Assigned to Membranes. 200-210 - Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits. 211-222 - Hiroshi Umeo, Masaya Hisaoka, Masato Teraoka, Masashi Maeda:
Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays. 223-232 - Markus Holzer, Martin Kutrib:
Register Complexity of LOOP-, WHILE-, and GOTO-Programs. 233-244 - Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato:
Classification and Universality of Reversible Logic Elements with One-Bit Memory. 245-256 - Alberto Leporati, Claudio Zandron, Giancarlo Mauri:
Universal Families of Reversible P Systems. 257-268 - Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Solving 3CNF-SAT and HPP in Linear Time Using WWW. 269-280 - Jean Néraud:
Completing a Code in a Regular Submonoid of the Free Monoid. 281-291 - Alexander Okhotin:
On Computational Universality in Language Equations. 292-303 - Mario J. Pérez-Jiménez, Francisco José Romero-Campero:
Attacking the Common Algorithmic Problem by Recognizer P Systems. 304-315 - René Schott, Jean-Claude Spehner:
On the Minimal Automaton of the Shuffle of Words and Araucarias. 316-327
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
