77 citations
- Université Paris-Est CréteilFR14 papers
- Centre National de la Recherche ScientifiqueFR7 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR5 papers
- Paris-Est SupFR5 papers
- Institute of Mathematics and Computer ScienceMD3 papers
- Université Paris DiderotFR3 papers
- Åbo Akademi UniversityFI2 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Laboratoire d'Informatique de Paris-NordFR2 papers
- Laboratoire d'Informatique Gaspard-MongeFR2 papers
- Laboratoire Spécification et VérificationFR2 papers
5 papers · 1 filter
Matrix Insertion-Deletion Systems
Ion Petre, Sergey Verlan
In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-fr…
Graph-Controlled Insertion-Deletion Systems
Rudolf Freund, Marian Kogler, Yurii Rogozhin +1
In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computati…
Variable elimination for building interpreters
Julien Cohen, Jean-Louis Giavitto, Olivier Michel
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (th…
Evolving MultiAlgebras unify all usual sequential computation models
Serge Grigorieff, Pierre Valarcher
It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is…
Ultimate Traces of Cellular Automata
Julien Cervelle, Enrico Formenti, Pierre Guillon
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their nei…