Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 142 matches
- 2022
- Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Prescribed Teams of Rules Working on Several Objects. MCU 2022: 27-41 - Bogdan Aman:
From Networks of Reaction Systems to Communicating Reaction Systems and Back. MCU 2022: 42-57 - Manon Blanc, Olivier Bournez:
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. MCU 2022: 58-74 - Lucie Ciencialová, Ludek Cienciala, Erzsébet Csuhaj-Varjú:
Languages of Distributed Reaction Systems. MCU 2022: 75-90 - Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. MCU 2022: 91-108 - Enrico Formenti:
Complexity of Local, Global and Universality Properties in Finite Dynamical Systems. MCU 2022: 1-11 - Benedek Nagy:
From Finite Automata to Fractal Automata - The Power of Recursion. MCU 2022: 109-125 - Viktor Olejár, Alexander Szabari:
Closure Properties of Subregular Languages Under Operations. MCU 2022: 126-142 - David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez:
P Systems with Evolutional Communication and Separation Rules. MCU 2022: 143-157 - Petr Sosík, Jan Drastík:
Computational Universality and Efficiency in Morphogenetic Systems. MCU 2022: 158-171 - Bianca Truthe:
A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors. MCU 2022: 12-26 - Aleksandr S. Tvardovskii, Nina Yevtushenko:
Adaptive Experiments for State Identification in Finite State Machines with Timeouts. MCU 2022: 172-188 - 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 [contents] - 2018
- Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Sequential Grammars with Activation and Blocking of Rules. MCU 2018: 51-68 - Cosmin Bonchis, Gabriel Istrate, Vlad Rochian:
The Language (and Series) of Hammersley-Type Processes. MCU 2018: 69-87 - Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. MCU 2018: 88-104 - Rudolf Freund:
Control Mechanisms for Array Grammars on Cayley Grids. MCU 2018: 1-33 - Viliam Geffert, Zuzana Bednárová:
Minimal Useful Size of Counters for (Real-Time) Multicounter Automata. MCU 2018: 105-120 - Benedek Nagy, Sándor Vályi:
An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines. MCU 2018: 137-152 - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
A Framework for (De)composing with Boolean Automata Networks. MCU 2018: 121-136 - Michel Raynal, Jiannong Cao:
A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality. MCU 2018: 34-50 - Richard Whyman:
Physical Computation and First-Order Logic. MCU 2018: 153-169 - Jérôme Durand-Lose, Sergey Verlan:
Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, Proceedings. Lecture Notes in Computer Science 10881, Springer 2018, ISBN 978-3-319-92401-4 [contents] - 2015
- Sergiu Ivanov, Sergey Verlan:
Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States. MCU 2015: 79-93 - Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil:
A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. MCU 2015: 31-44 - Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU 2015: 45-60 - Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. MCU 2015: 61-78 - Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers:
The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems. MCU 2015: 149-163 - Timo Jolivet, Anne Siegel:
Decidability Problems for Self-induced Systems Generated by a Substitution. MCU 2015: 3-16 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown Automata. MCU 2015: 94-112
skipping 112 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-30 03:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint