default search action
9th MCU 2022: Debrecen, Hungary
- Jérôme Durand-Lose, György Vaszil:
Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings. Lecture Notes in Computer Science 13419, Springer 2022, ISBN 978-3-031-13501-9 - Enrico Formenti:
Complexity of Local, Global and Universality Properties in Finite Dynamical Systems. 1-11 - Bianca Truthe:
A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors. 12-26 - Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Prescribed Teams of Rules Working on Several Objects. 27-41 - Bogdan Aman:
From Networks of Reaction Systems to Communicating Reaction Systems and Back. 42-57 - Manon Blanc, Olivier Bournez:
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. 58-74 - Lucie Ciencialová, Ludek Cienciala, Erzsébet Csuhaj-Varjú:
Languages of Distributed Reaction Systems. 75-90 - Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. 91-108 - Benedek Nagy:
From Finite Automata to Fractal Automata - The Power of Recursion. 109-125 - Viktor Olejár, Alexander Szabari:
Closure Properties of Subregular Languages Under Operations. 126-142 - David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez:
P Systems with Evolutional Communication and Separation Rules. 143-157 - Petr Sosík, Jan Drastík:
Computational Universality and Efficiency in Morphogenetic Systems. 158-171 - Aleksandr S. Tvardovskii, Nina Yevtushenko:
Adaptive Experiments for State Identification in Finite State Machines with Timeouts. 172-188
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.