MCU - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 152

2025

Machines, Computations, and Universality - 10th International Conference, MCU 2024, Nice, France, June 5-7, 2024, Revised Selected PapersEnrico Formenti, Jérôme Durand-Lose, editors, Volume 15270 of Lecture Notes in Computer Science, Springer, 2025. [doi]

2024

Universality of Turing Tumble of Finite SizeArtiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001, Sergey Verlan. mcu 2025: 72-88 [doi]

Computing Threshold Circuits with Void Reactions in Step Chemical Reaction NetworksRachel Anderson, Alberto Avila, Bin Fu, Timothy Gomez, Elise Grizzell, Aiden Massie, Gourab Mukhopadhyay, Adrian Salinas, Robert T. Schweller, Evan Tomai, Tim Wylie. mcu 2025: 52-71 [doi]

On the Powers of the Collatz FunctionDidier Caucal, Chloé Rispal. mcu 2025: 115-129 [doi]

On Switching Finite State AutomataJoss Chapman, Markus Holzer 0001, Petra Wolf 0002. mcu 2025: 35-51 [doi]

Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal FormsHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. mcu 2025: 17-34 [doi]

On the Power of Small Watson-Crick Automata and Variants of String Assembling SystemsAndrás Murvai, György Vaszil. mcu 2025: 89-102 [doi]

From Petri Nets to Virus MachinesDavid Orellana-Martín, Álvaro Romero Jiménez, Agustín Riscos-Núñez, Mario J. Pérez-Jiménez. mcu 2025: 103-114 [doi]

On the Entanglement and Mixedness of Quantum Boolean Function CircuitsZornitza Genova Prodanoff, Iliya Kulbaka, Natasha Interlichia. mcu 2025: 130-152 [doi]

Complexity of Infinite WordsSvetlana Puzynina. mcu 2025: 1-16 [doi]

2022

Prescribed Teams of Rules Working on Several ObjectsArtiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001, Sergey Verlan. mcu 2022: 27-41 [doi]

From Networks of Reaction Systems to Communicating Reaction Systems and BackBogdan Aman. mcu 2022: 42-57 [doi]

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential EquationsManon Blanc, Olivier Bournez. mcu 2022: 58-74 [doi]

Languages of Distributed Reaction SystemsLucie Ciencialová, Ludek Cienciala, Erzsébet Csuhaj-Varjú. mcu 2022: 75-90 [doi]

PSPACE-Completeness of Reversible Deterministic SystemsErik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch. mcu 2022: 91-108 [doi]

Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, ProceedingsJérôme Durand-Lose, György Vaszil, editors, Volume 13419 of Lecture Notes in Computer Science, Springer, 2022. [doi]

Complexity of Local, Global and Universality Properties in Finite Dynamical SystemsEnrico Formenti. mcu 2022: 1-11 [doi]

From Finite Automata to Fractal Automata - The Power of RecursionBenedek Nagy. mcu 2022: 109-125 [doi]

Closure Properties of Subregular Languages Under OperationsViktor Olejar, Alexander Szabari. mcu 2022: 126-142 [doi]

P Systems with Evolutional Communication and Separation RulesDavid Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez. mcu 2022: 143-157 [doi]

Computational Universality and Efficiency in Morphogenetic SystemsPetr Sosík, Jan Drastík. mcu 2022: 158-171 [doi]

A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary ProcessorsBianca Truthe. mcu 2022: 12-26 [doi]

Adaptive Experiments for State Identification in Finite State Machines with TimeoutsAleksandr S. Tvardovskii, Nina Yevtushenko 0001. mcu 2022: 172-188 [doi]

2018

Sequential Grammars with Activation and Blocking of RulesArtiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001. mcu 2018: 51-68 [doi]

The Language (and Series) of Hammersley-Type ProcessesCosmin Bonchis, Gabriel Istrate, Vlad Rochian. mcu 2018: 69-87 [doi]

Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, ProceedingsJérôme Durand-Lose, Sergey Verlan, editors, Volume 10881 of Lecture Notes in Computer Science, Springer, 2018. [doi]

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple CaseHenning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman. mcu 2018: 88-104 [doi]

Control Mechanisms for Array Grammars on Cayley GridsRudolf Freund. mcu 2018: 1-33 [doi]

Minimal Useful Size of Counters for (Real-Time) Multicounter AutomataViliam Geffert, Zuzana Bednárová. mcu 2018: 105-120 [doi]

An Extension of Interval-Valued Computing Equivalent to Red-Green Turing MachinesBenedek Nagy, Sándor Vályi. mcu 2018: 137-152 [doi]

A Framework for (De)composing with Boolean Automata NetworksKévin Perrot, Pacôme Perrotin, Sylvain Sené. mcu 2018: 121-136 [doi]

A Pleasant Stroll Through the Land of Distributed Machines, Computation, and UniversalityMichel Raynal, Jiannong Cao. mcu 2018: 34-50 [doi]

Physical Computation and First-Order LogicRichard Whyman. mcu 2018: 153-169 [doi]

2015

Universality of Graph-controlled Leftist Insertion-deletion Systems with Two StatesSergiu Ivanov 0001, Sergey Verlan. mcu 2015: 79-93 [doi]

A Connection Between Red-Green Turing Machines and Watson-Crick T0L SystemsErzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil. mcu 2015: 31-44 [doi]

Tight Bounds for Cut-Operations on Deterministic Finite AutomataFrank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe. mcu 2015: 45-60 [doi]

Machines, Computations, and Universality - 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, ProceedingsJérôme Durand-Lose, Benedek Nagy, editors, Volume 9288 of Lecture Notes in Computer Science, Springer, 2015. [doi]

Non-isometric Contextual Array Grammars with Regular Control and Local SelectorsHenning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian. mcu 2015: 61-78 [doi]

The Simulation Powers and Limitations of Hierarchical Self-Assembly SystemsJacob Hendricks, Matthew J. Patitz, Trent A. Rogers. mcu 2015: 149-163 [doi]

Decidability Problems for Self-induced Systems Generated by a SubstitutionTimo Jolivet, Anne Siegel. mcu 2015: 3-16 [doi]

Reversible Limited AutomataMartin Kutrib, Matthias Wendlandt. mcu 2015: 113-128 [doi]

Tinput-Driven Pushdown AutomataMartin Kutrib, Andreas Malcher, Matthias Wendlandt. mcu 2015: 94-112 [doi]

An Intrinsically Universal Family of Causal Graph DynamicsSimon Martiel, Bruno Martin. mcu 2015: 129-148 [doi]

A Characterization of NP Within Interval-Valued ComputingBenedek Nagy, Sándor Vályi. mcu 2015: 164-179 [doi]

Towards Formal Verification of Computations and Hypercomputations in Relativistic PhysicsMike Stannett. mcu 2015: 17-27 [doi]

Universality in Infinite Petri NetsDmitry A. Zaitsev. mcu 2015: 180-197 [doi]

2007

Encapsulating Reaction-Diffusion ComputersAndrew Adamatzky. mcu 2007: 1-11 [doi]

Partial Halting in P Systems Using Membrane Rules with Permitting ContextsArtiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan. mcu 2007: 110-121 [doi]

Uniform Solution ofArtiom Alhazov, Mario J. Pérez-Jiménez. mcu 2007: 122-133 [doi]

Satisfiability Parsimoniously Reduces to the Tantrix:::TM::: Rotation Puzzle ProblemDorothea Baumeister, Jörg Rothe. mcu 2007: 134-145 [doi]

Planar Trivalent Network ComputationTommaso Bolognesi. mcu 2007: 146-157 [doi]

On the Computational Capabilities of Several ModelsOlivier Bournez, Emmanuel Hainry. mcu 2007: 12-23 [doi]

Universality, Reducibility, and CompletenessMark Burgin. mcu 2007: 24-38 [doi]

Using Approximation to Relate Computational Classes over the RealsManuel Lameiras Campagnolo, Kerry Ojakian. mcu 2007: 39-61 [doi]

Accepting Networks of Splicing Processors with Filtered ConnectionsJuan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana. mcu 2007: 218-229 [doi]

On the Power of Networks of Evolutionary ProcessorsJürgen Dassow, Bianca Truthe. mcu 2007: 158-169 [doi]

Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, ProceedingsJérôme Olivier Durand-Lose, Maurice Margenstern, editors, Volume 4664 of Lecture Notes in Computer Science, Springer, 2007.

Query Completeness of Skolem Machine ComputationsJohn Fisher, Marc Bezem. mcu 2007: 182-192 [doi]

More on the Size of Higman-Haines Sets: Effective ConstructionsHermann Gruber, Markus Holzer, Martin Kutrib. mcu 2007: 193-204 [doi]

A Survey of Infinite Time Turing MachinesJoel David Hamkins. mcu 2007: 62-71 [doi]

The Tiling Problem Revisited (Extended Abstract)Jarkko Kari. mcu 2007: 72-79 [doi]

Decision Versus Evaluation in Algebraic ComplexityPascal Koiran. mcu 2007: 80-89 [doi]

Insertion-Deletion Systems with One-Sided ContextsArtiom Matveevici, Yurii Rogozhin, Sergey Verlan. mcu 2007: 205-217 [doi]

Study of Limits of Solvability in Tag SystemsLiesbeth De Mol. mcu 2007: 170-181 [doi]

A Universal Reversible Turing MachineKenichi Morita, Yoshikazu Yamaguchi. mcu 2007: 90-98 [doi]

Hierarchical Relaxations of the Correctness Preserving Property for Restarting AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. mcu 2007: 230-241 [doi]

Four Small Universal Turing MachinesTurlough Neary, Damien Woods. mcu 2007: 242-254 [doi]

Changing the Neighborhood of Cellular AutomataHidenosuke Nishio. mcu 2007: 255-266 [doi]

A Simple P-Complete Problem and Its Representations by Language EquationsAlexander Okhotin. mcu 2007: 267-278 [doi]

P Systems and Picture LanguagesK. G. Subramanian. mcu 2007: 99-109 [doi]

Slightly Beyond Turing s Computability for Studying Genetic ProgrammingOlivier Teytaud. mcu 2007: 279-290 [doi]

A Smallest Five-State Solution to the Firing Squad Synchronization ProblemHiroshi Umeo, Takashi Yanagihara. mcu 2007: 291-302 [doi]

Small Semi-weakly Universal Turing MachinesDamien Woods, Turlough Neary. mcu 2007: 303-315 [doi]

Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4::::n::::-Steps SolutionJean-Baptiste Yunès. mcu 2007: 316-324 [doi]

2005

Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected PapersMaurice Margenstern, editor, Volume 3354 of Lecture Notes in Computer Science, Springer, 2005.

2004

Computational Completeness of P Systems with Active Membranes and Two PolarizationsArtiom Alhazov, Rudolf Freund, Gheorghe Paun. mcu 2005: 82-92 [doi]

Computing with a Distributed Reaction-Diffusion ModelStefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone. mcu 2005: 93-103 [doi]

Algorithmic Randomness, Quantum Physics, and IncompletenessCristian Calude. mcu 2005: 1-17 [doi]

Ordering and Convex PolyominoesGiusi Castiglione, Antonio Restivo. mcu 2005: 128-139 [doi]

Subshifts Behavior of Cellular Automata. Topological Properties and Related LanguagesGianpiero Cattaneo, Alberto Dennunzio. mcu 2005: 140-152 [doi]

Evolution and Observation: A Non-standard Way to Accept Formal LanguagesMatteo Cavaliere, Peter Leupold. mcu 2005: 153-163 [doi]

On the Complexity of Universal ProgramsAlain Colmerauer. mcu 2005: 18-35 [doi]

Computational Universality in Symbolic Dynamical SystemsJean-Charles Delvenne, Petr Kurka, Vincent D. Blondel. mcu 2005: 104-115 [doi]

Abstract Geometrical Computation for Black Hole ComputationJérôme Durand-Lose. mcu 2005: 176-187 [doi]

Is Bosco s Rule Universal?Kellie Michele Evans. mcu 2005: 188-199 [doi]

Sequential P Systems with Unit Rules and Energy Assigned to MembranesRudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron. mcu 2005: 200-210 [doi]

Hierarchies of DLOGTIME-Uniform CircuitsChuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu. mcu 2005: 211-222 [doi]

Finite Sets of Words and ComputingJuhani Karhumäki. mcu 2005: 36-49 [doi]

Universal Families of Reversible P SystemsAlberto Leporati, Claudio Zandron, Giancarlo Mauri. mcu 2005: 257-268 [doi]

Solving 3CNF-SAT and HPP in Linear Time Using WWWFlorin Manea, Carlos Martín-Vide, Victor Mitrana. mcu 2005: 269-280 [doi]

Classification and Universality of Reversible Logic Elements with One-Bit MemoryKenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato. mcu 2005: 245-256 [doi]

The Computational Power of Continuous Dynamic SystemsJerzy Mycka, José Félix Costa. mcu 2005: 164-175 [doi]

Completing a Code in a Regular Submonoid of the Free MonoidJean Neraud. mcu 2005: 281-291 [doi]

On Computational Universality in Language EquationsAlexander Okhotin. mcu 2005: 292-303 [doi]

Attacking the Common Algorithmic Problem by Recognizer P SystemsMario J. Pérez-Jiménez, Francisco José Romero-Campero. mcu 2005: 304-315 [doi]

On the Minimal Automaton of the Shuffle of Words and AraucariasRené Schott, Jean-Claude Spehner. mcu 2005: 316-327 [doi]

Universality and Cellular AutomataKlaus Sutner. mcu 2005: 50-59 [doi]

Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular ArraysHiroshi Umeo, Masaya Hisaoka, Masato Teraoka, Masashi Maeda. mcu 2005: 223-232 [doi]

Leaf Language ClassesKlaus W. Wagner. mcu 2005: 60-81 [doi]

Links

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

MCU (mcu)

Viewing Publication 1 - 100 from 152

2025

2024

2022

2018

2015

2007

2005

2004

Links

Filter by YearOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

MCU (mcu)

Viewing Publication 1 - 100 from 152

2025

2024

2022

2018

2015

2007

2005

2004

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1