On a Variant of Constructivisation of the Theory of Almost Periodic Functions. - Maurice Margenstern (Math. Log. Q., 1978)

Sur une Extension Simple du calcul intuitionniste des predicats du premier ordre Appliquee a L'analyse. - Maurice Margenstern (Math. Log. Q., 1984)

Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. - Maurice Margenstern (FCT, 1993)

Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. - Maurice Margenstern (Theor. Comput. Sci., 1994)

Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. - Maurice Margenstern (LATIN, 1995)

Foreword: Universal Machines and Computations. - Maurice Margenstern (Theor. Comput. Sci., 1996)

Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. - Maurice Margenstern (LFCS, 1997)

The Laterality Problem for Non-Erasing Turing Machines on {0, 1} is Completely Solved. - Maurice Margenstern (RAIRO Theor. Informatics Appl., 1997)

Universality of the Chip-Firing Game. - Eric Goles Ch.; Maurice Margenstern (Theor. Comput. Sci., 1997)

Some small self-describing Turing machines. - Maurice Margenstern; Iurie Rogojin (Comput. Sci. J. Moldova, 1998)

Universality of Reversible Hexagonal Cellular Automata. - Kenichi Morita; Maurice Margenstern; Katsunobu Imai (RAIRO Theor. Informatics Appl., 1999)

A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. - Maurice Margenstern; Kenichi Morita (J. Univers. Comput. Sci., 1999)

Nine switch-affine neurons suffice for Turing universality. - Hava T. Siegelmann; Maurice Margenstern (Neural Networks, 1999)

About Time-Varying Distributed H Systems. - Maurice Margenstern; Yurii Rogozhin (DNA Computing, 2000)

A package of algorithms to devise cellular automata in the hyperbolic plane and related questions. - Maurice Margenstern (Comput. Sci. J. Moldova, 2000)

New Tools for Cellular Automata in the Hyperbolic Plane. - Maurice Margenstern (J. Univers. Comput. Sci., 2000)

Frontier between decidability and undecidability: a survey. - Maurice Margenstern (Theor. Comput. Sci., 2000)

Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages. - Maurice Margenstern; Yurii Rogozhin (Words, Semigroups, and Transductions, 2001)

Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages. - Maurice Margenstern; Yurii Rogozhin (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Computing with Membranes: Variants with an Enhanced Membrane Handling. - Maurice Margenstern; Carlos Martín-Vide; Gheorghe Paun (DNA, 2001)

A Universal Time-Varying Distributed H System of Degree 1. - Maurice Margenstern; Yurii Rogozhin (DNA, 2001)

Two railway circuits: a universal circuit and an NP-difficult one. - Maurice Margenstern (Comput. Sci. J. Moldova, 2001)

On quasi-unilateral universal Turing machines. - Maurice Margenstern (Theor. Comput. Sci., 2001)

NP problems are tractable in the space of cellular automata in the hyperbolic plane. - Maurice Margenstern; Kenichi Morita (Theor. Comput. Sci., 2001)

Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. - Maurice Margenstern; Yurii Rogozhin; Sergey Verlan (DNA, 2002)

The splitting method and Poincare's theorem: (I) - the geometric part. - Maurice Margenstern (Comput. Sci. J. Moldova, 2002)

Self-describing Turing machines. - Maurice Margenstern; Yurii Rogozhin (Fundam. Informaticae, 2002)

Tiling the Hyperbolic Plane with a Single Pentagonal Tile. - Maurice Margenstern (J. Univers. Comput. Sci., 2002)

A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology. - Maurice Margenstern (CATA, 2003)

Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. - Maurice Margenstern (DMTCS, 2003)

Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. - Maurice Margenstern; Yurii Rogozhin; Sergey Verlan (DNA, 2003)

P Systems with Cutting/Recombination Rules Assigned to Membranes. - Franziska Freund; Rudolf Freund; Marion Oswald; Maurice Margenstern; Yurii Rogozhin; Sergey Verlan (Workshop on Membrane Computing, 2003)

Can Hyperbolic Geometry Be of Help for P Systems?. - Maurice Margenstern (Workshop on Membrane Computing, 2003)

The splitting method and Poincare's theorem: (II) - matrix, polynomial and language. - Maurice Margenstern (Comput. Sci. J. Moldova, 2003)

Foreword. - Martin Kutrib; Maurice Margenstern; Hiroshi Umeo (Fundam. Informaticae, 2003)

On the Infinigons of the Hyperbolic Plane, A combinatorial approach. - Maurice Margenstern (Fundam. Informaticae, 2003)

Tools for devising cellular automata in the hyperbolic 3D space. - Maurice Margenstern; Guentcho Skordev (Fundam. Informaticae, 2003)

On the Optimal Number of Instructions for Universal Turing Machines Connected With a Finite Automaton. - Maurice Margenstern; Lioudmila Pavlotskaïa (Int. J. Algebra Comput., 2003)

Fibonacci Type Coding for the Regular Rectangular Tilings of the Hyperbolic Plane. - Maurice Margenstern; Guentcho Skordev (J. Univers. Comput. Sci., 2003)

A universal cellular automaton in the hyperbolic plane. - Francine Herrmann; Maurice Margenstern (Theor. Comput. Sci., 2003)

Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment. - Kamel Chelghoum; Maurice Margenstern; Benoît Martin; Isabelle Pecci (ACRI, 2004)

Splicing Systems for Universal Turing Machines. - Tero Harju; Maurice Margenstern (DNA, 2004)

Accepting Hybrid Networks of Evolutionary Processors. - Maurice Margenstern; Victor Mitrana; Mario J. Pérez-Jiménez (DNA, 2004)

Palette hyperbolique: un outil pour interagir avec des ensembles de données. - Kamel Chelghoum; Maurice Margenstern; Benoît Martin; Isabelle Pecci (IHM, 2004)

Communicative P Systems with Minimal Cooperation. - Artiom Alhazov; Maurice Margenstern; Vladimir Rogozhin; Yurii Rogozhin; Sergey Verlan (Workshop on Membrane Computing, 2004)

lambda-P Systems and Typed lambda-Calculus. - Loïc Colson; Natasa Jonoska; Maurice Margenstern (Workshop on Membrane Computing, 2004)

Register Cellular Automata in the Hyperbolic Plane. - Serge Grigorieff; Maurice Margenstern (Fundam. Informaticae, 2004)

Tree Operations in P Systems and lamda-Calculus. - Natasa Jonoska; Maurice Margenstern (Fundam. Informaticae, 2004)

Initialising Cellular Automata in the Hyperbolic Plane. - Kamel Chelghoum; Maurice Margenstern; Benoît Martin; Isabelle Pecci (IEICE Trans. Inf. Syst., 2004)

Time and Space Complexity Classes of Hyperbolic Cellular Automata. - Chuzo Iwamoto; Maurice Margenstern (IEICE Trans. Inf. Syst., 2004)

The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric. - Maurice Margenstern (J. Univers. Comput. Sci., 2004)

On P Systems with Bounded Parallelism. - Francesco Bernardini; Francisco José Romero-Campero; Marian Gheorghe 001; Mario J. Pérez-Jiménez; Maurice Margenstern; Sergey Verlan; Natalio Krasnogor (SYNASC, 2005)

Time-Varying Distributed H Systems: An Overview. - Maurice Margenstern; Sergey Verlan; Yurii Rogozhin (Fundam. Informaticae, 2005)

About Splicing P Systems with One Membrane. - Sergey Verlan; Maurice Margenstern (Fundam. Informaticae, 2005)

Context-free insertion-deletion systems. - Maurice Margenstern; Gheorghe Paun; Yurii Rogozhin; Sergey Verlan (Theor. Comput. Sci., 2005)

An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces. - Maurice Margenstern (FCS, 2006)

P Colonies with a Bounded Number of Cells and Programs. - Erzsébet Csuhaj-Varjú; Maurice Margenstern; György Vaszil (Workshop on Membrane Computing, 2006)

Computational Completeness of Tissue P Systems with Conditional Uniport. - Sergey Verlan; Francesco Bernardini; Marian Gheorghe 001; Maurice Margenstern (Workshop on Membrane Computing, 2006)

Substitutions for tilings $ {p,q }$ - Maurice Margenstern; Guentcho Skordev (CoRR, 2006)

Computing by Floating Strings. - Giuditta Franco; Maurice Margenstern (MeCBIC@ICALP, 2006)

Surprising Areas in the Quest for Small Universal Devices. - Maurice Margenstern (MFCSIT, 2006)

Machines, Computations and Universality. - Maurice Margenstern (Fundam. Informaticae, 2006)

A New Way to Implement Cellular Automata on the Penta- and Heptagrids. - Maurice Margenstern (J. Cell. Autom., 2006)

On the Communication Between Cells of a Cellular Automaton on the Penta- and Heptagrids of the Hyperbolic Plane. - Maurice Margenstern (J. Cell. Autom., 2006)

A Universal Cellular Automaton with Five States in the 3D Hyperbolic Space. - Maurice Margenstern (J. Cell. Autom., 2006)

About an Algorithmic Approach to Tilings {p, q} of the Hyperbolic Plane. - Maurice Margenstern (J. Univers. Comput. Sci., 2006)

Producer/Consumer in Membrane Systems and Petri Nets. - Francesco Bernardini; Marian Gheorghe 001; Maurice Margenstern; Sergey Verlan (CiE, 2007)

About the domino problem in the hyperbolic plane, a new solution: complement - Maurice Margenstern (CoRR, 2007)

Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? - Maurice Margenstern (CoRR, 2007)

About the domino problem in the hyperbolic plane, a new solution - Maurice Margenstern (CoRR, 2007)

Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane. - Maurice Margenstern (Comput. Sci. J. Moldova, 2007)

On Algebraic Structure of Neighborhoods of Cellular AutomataHorse Power Problem. - Hidenosuke Nishio; Maurice Margenstern; Friedrich von Haeseler (Fundam. Informaticae, 2007)

On small universal antiport P systems. - Erzsébet Csuhaj-Varjú; Maurice Margenstern; György Vaszil; Sergey Verlan (Theor. Comput. Sci., 2007)

A Proposal for a Japanese Keyboard on Cellular Phones. - Maurice Margenstern; Benoît Martin; Hiroshi Umeo; Shogo Yamano; Kazuhiro Nishioka (ACRI, 2008)

Fast Synchronization in P Systems. - Artiom Alhazov; Maurice Margenstern; Sergey Verlan (Workshop on Membrane Computing, 2008)

On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract) - Maurice Margenstern (CSP, 2008)

A Universal Cellular Automaton on the Ternary Heptagrid. - Maurice Margenstern; Yu Song (RP, 2008)

How to Synchronize the Activity of All Components of a P System? - Francesco Bernardini; Marian Gheorghe 001; Maurice Margenstern; Sergey Verlan (Int. J. Found. Comput. Sci., 2008)

The Finite Tiling Problem is Undecidable in the Hyperbolic Plane. - Maurice Margenstern (Int. J. Found. Comput. Sci., 2008)

On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane. - Maurice Margenstern (Int. J. Found. Comput. Sci., 2008)

About the domino problem in the hyperbolic plane from an algorithmic point of view. - Maurice Margenstern (RAIRO Theor. Informatics Appl., 2008)

A Uniform and Intrinsic Proof that there are Universal Cellular Automata in Hyperbolic Spaces. - Maurice Margenstern (J. Cell. Autom., 2008)

Research Notices: The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. - Maurice Margenstern (SIGACT News, 2008)

A DNA computing inspired computational model. - Giuditta Franco; Maurice Margenstern (Theor. Comput. Sci., 2008)

The domino problem of the hyperbolic plane is undecidable. - Maurice Margenstern (Theor. Comput. Sci., 2008)

Generalized communicating P systems. - Sergey Verlan; Francesco Bernardini; Marian Gheorghe 001; Maurice Margenstern (Theor. Comput. Sci., 2008)

The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. - Maurice Margenstern (RP, 2009)

A new universal cellular automaton on the ternary heptagrid - Maurice Margenstern (CoRR, 2009)

Iterative pushdown automata and hyperbolic contour words - Maurice Margenstern (CoRR, 2009)

Navigation in tilings of the hyperbolic plane and possible applications - Maurice Margenstern (CoRR, 2009)

About a new splitting for the algorithmic study of the tilings $ {p,q }$ of the hyperbolic plane when $q$ is odd - Maurice Margenstern (CoRR, 2009)

About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane. - Maurice Margenstern (AUTOMATA, 2009)

The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable. - Maurice Margenstern (Fundam. Informaticae, 2009)

Array P Systems and t.Communication. - K. G. Subramanian 001; Rosihan M. Ali; Atulya K. Nagar; Maurice Margenstern (Fundam. Informaticae, 2009)

Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells. - Francesco Bernardini; Marian Gheorghe 001; Maurice Margenstern; Sergey Verlan (Int. J. Unconv. Comput., 2009)

A New Universal Cellular Automaton on the Pentagrid. - Maurice Margenstern; Yu Song (Parallel Process. Lett., 2009)

Cellular Automata in Hyperbolic Spaces. - Maurice Margenstern (Encyclopedia of Complexity and Systems Science, 2009)

Computation with Competing Patterns in Life-Like Automaton. - Genaro J. Martínez; Andrew Adamatzky; Kenichi Morita; Maurice Margenstern (Game of Life Cellular Automata, 2010)

A weakly universal cellular automaton in the hyperbolic 3D space with three states. - Maurice Margenstern (Automata, 2010)

Computation with competing patterns in Life-like automaton. - Genaro Juárez Martínez; Andrew Adamatzky; Kenichi Morita; Maurice Margenstern (HPCS, 2010)

An Upper Bound on the Number of States for a Strongly Universal Hyperbolic Cellular Automaton on the Pentagrid. - Maurice Margenstern (JAC, 2010)

An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later. - Maurice Margenstern (Int. Conf. on Membrane Computing, 2010)

Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. - Maurice Margenstern (RP, 2010)

Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345. - Genaro Juárez Martínez; Kenichi Morita; Andrew Adamatzky; Maurice Margenstern (UC, 2010)

Turing Machines with Two Letters and Two States. - Maurice Margenstern (Complex Syst., 2010)

About the embedding of one dimensional cellular automata into hyperbolic cellular automata - Maurice Margenstern (CoRR, 2010)

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. - Florin Manea; Maurice Margenstern; Victor Mitrana; Mario J. Pérez-Jiménez (Theory Comput. Syst., 2010)

Cellular automata and discrete geometry. - Isabelle Debled-Rennesson; Maurice Margenstern (HPCS, 2011)

Bacteria inspired patterns grown with hyperbolic cellular automata. - Maurice Margenstern (HPCS, 2011)

A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. - Maurice Margenstern (RP, 2011)

Coordinates for a new triangular tiling of the hyperbolic plane - Maurice Margenstern (CoRR, 2011)

A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane - Maurice Margenstern (CoRR, 2011)

DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification - Maurice Margenstern; Pascal Mayer; Sergey Verlan (CoRR, 2011)

Using Grossone to count the number of elements of infinite sets and the connection with bijections - Maurice Margenstern (CoRR, 2011)

Universality of Splicing Test Tube Systems with Two Tubes. - Sergey Verlan; Maurice Margenstern (Fundam. Informaticae, 2011)

Small Universal Tvdh and Test Tube Systems. - Artiom Alhazov; Marian Kogler 001; Maurice Margenstern; Yurii Rogozhin; Sergey Verlan (Int. J. Found. Comput. Sci., 2011)

A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. - Maurice Margenstern (Theor. Comput. Sci., 2011)

Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane. - Maurice Margenstern (ICCCI (1), 2012)

Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem. - Maurice Margenstern (UCNC, 2012)

An application of Grossone to the study of a family of tilings of the hyperbolic plane. - Maurice Margenstern (Appl. Math. Comput., 2012)

A family of weakly universal cellular automata in the hyperbolic plane with two states - Maurice Margenstern (CoRR, 2012)

Preface. - Jérôme Durand-Lose; Maurice Margenstern; Klaus Sutner (Int. J. Found. Comput. Sci., 2012)

Universal Cellular Automata with Two States in the Hyperbolic Plane. - Maurice Margenstern (J. Cell. Autom., 2012)

Hyperbolic tilings and formal language theory. - Maurice Margenstern; K. G. Subramanian 001 (MCU, 2013)

A proposal for a Chinese keyboard for cellphones, smartphones, ipads and tablets. - Maurice Margenstern; Lan Wu (CoRR, 2013)

About Strongly Universal Cellular Automata - Maurice Margenstern (MCU, 2013)

Cellular Automata and Naive Discrete Lines - I. - Isabelle Debled-Rennesson; Maurice Margenstern (J. Cell. Autom., 2013)

Modeling and Simulation of a Car Race. - Rolf Hoffmann; Maurice Margenstern (J. Cell. Autom., 2013)

A Weakly Universal Cellular Automaton in the Pentagrid with Five States. - Maurice Margenstern (Computing with New Resources, 2014)

A Weakly Universal Cellular Automaton on the Heptagrid with Three States. - Maurice Margenstern (CANDAR, 2014)

A note on groups of a family of hyperbolic tessellations. - Anthony Gasperin; Maurice Margenstern (CoRR, 2014)

Pentagrid and Heptagrid: the Fibonacci Technique and Group Theory. - Maurice Margenstern (J. Autom. Lang. Comb., 2014)

Fibonacci words, hyperbolic tilings and grossone. - Maurice Margenstern (Commun. Nonlinear Sci. Numer. Simul., 2015)

About embedded quarters and points at infinity in the hyperbolic plane. - Maurice Margenstern (CoRR, 2015)

A weakly universal cellular automaton on the pentagrid with three states. - Maurice Margenstern (CoRR, 2015)

Preface. - Svetlana Cojocaru; Maurice Margenstern; Gheorghe Paun; Sergey Verlan (Fundam. Informaticae, 2015)

An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results. - Maurice Margenstern (Fundam. Informaticae, 2015)

Automates cellulaires hyperboliques universels II. - Maurice Margenstern (Tech. Sci. Informatiques, 2015)

Infinigons of the hyperbolic plane and grossone. - Maurice Margenstern (Appl. Math. Comput., 2016)

A new system of coordinates for the tilings $ {p, 3 }$ and $ {p$$-$$2, 4 }$. - Maurice Margenstern (CoRR, 2016)

A weakly universal universal cellular automaton on the tessellation $ {8, 3 }$. - Maurice Margenstern (CoRR, 2016)

A weakly universal universal cellular automaton in the heptagrid. - Maurice Margenstern (CoRR, 2016)

A Weakly Universal Cellular Automaton with 2 States on the Tiling {11, 3}. - Maurice Margenstern (J. Cell. Autom., 2016)

A Weakly Universal Cellular Automaton on the Tessellation {9, 3}. - Maurice Margenstern (J. Cell. Autom., 2017)

A weakly universal cellular automaton on the pentagrid with two states. - Maurice Margenstern (Int. J. Parallel Emergent Distributed Syst., 2017)

A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States. - Maurice Margenstern (Reversibility and Universality, 2018)

A decidability result for the halting problem of cellular automata in the pentagrid. - Maurice Margenstern (CoRR, 2018)

Navigation tools for cellular automata in two families of tilings of the hyperbolic plane. - Maurice Margenstern (Int. J. Parallel Emergent Distributed Syst., 2018)

Constructing Iterated Exponentials in Tilings of the Euclidean and of the Hyperbolic Plane. - Maurice Margenstern (From Parallel to Emergent Computing, 2019)

A Decidability Result for the Halting of Cellular Automata on the Pentagrid. - Maurice Margenstern (Complex Syst., 2019)

About Fibonacci trees. I. - Maurice Margenstern (CoRR, 2019)

About Fibonacci trees. II - generalized Fibonacci trees. - Maurice Margenstern (CoRR, 2019)

About Fibonacci trees III: multiple Fibonacci trees. - Maurice Margenstern (CoRR, 2019)

A strongly universal cellular automaton with four states. - Maurice Margenstern (CoRR, 2021)

An outer totalistic weakly universal cellular automaton in the dodecagrid with four states. - Maurice Margenstern (CoRR, 2021)

A Strongly Universal Cellular Automaton on the Heptagrid with Seven States. - Maurice Margenstern (J. Cell. Autom., 2021)

Multiple Fibonacci Trees. - Maurice Margenstern (Automata and Complexity, 2022)

A Strongly Universal Cellular Automaton in the Dodecagrid with Five States. - Maurice Margenstern (Int. J. Unconv. Comput., 2022)

What can we learn from universal Turing machines? - Maurice Margenstern (Int. J. Parallel Emergent Distributed Syst., 2022)

A weakly universal weighted cellular automaton in the heptagrid with 7 states. - Maurice Margenstern (CoRR, 2023)

A strongly universal cellular automaton on the heptagrif with seven states, new proof. - Maurice Margenstern (CoRR, 2023)

The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof. - Maurice Margenstern (Complex Syst., 2023)

A Strongly Universal Cellular Automaton on the Heptagrid with Six States. - Maurice Margenstern (Complex Syst., 2024)

Meadows in the Heptgrid and Possible Generalizations. - Maurice Margenstern (Comput. Sci. J. Moldova, 2024)

A weakly universal cellular automaton in the heptagrid of the hyperbolic plane. - Maurice Margenstern (Int. J. Parallel Emergent Distributed Syst., 2024)

Evolution of a Model. - Maurice Margenstern (Advances in Cellular Automata - Volume 1: Theory (1), 2025)