Maurice Margenstern

According to our database1, Maurice Margenstern authored at least 172 papers between 1978 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Navigation tools for cellular automata in two families of tilings of the hyperbolic plane.
IJPEDS, 2018

A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States.
Proceedings of the Reversibility and Universality, 2018

2017
A weakly universal cellular automaton on the pentagrid with two states.
IJPEDS, 2017

A Weakly Universal Cellular Automaton on the Tessellation {9, 3}.
J. Cellular Automata, 2017

2016
A Weakly Universal Cellular Automaton with 2 States on the Tiling {11, 3}.
J. Cellular Automata, 2016

A weakly universal universal cellular automaton in the heptagrid.
CoRR, 2016

A weakly universal universal cellular automaton on the tessellation $\{8, 3\}$.
CoRR, 2016

A weakly universal cellular automaton on the tessellation {9, 3}.
CoRR, 2016

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

Infinigons of the hyperbolic plane and grossone.
Applied Mathematics and Computation, 2016

2015
Automates cellulaires hyperboliques universels II.
Technique et Science Informatiques, 2015

An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results.
Fundam. Inform., 2015

Preface.
Fundam. Inform., 2015

A weakly universal cellular automaton on the pentagrid with three states.
CoRR, 2015

A weakly universal cellular automaton on the pentagrid with two states.
CoRR, 2015

About embedded quarters and points at infinity in the hyperbolic plane.
CoRR, 2015

Infinigons of the hyperbolic plane and grossone.
CoRR, 2015

A weakly universal cellular automaton with 2 states on the tiling {11, 3}.
CoRR, 2015

2014
Pentagrid and Heptagrid: the Fibonacci Technique and Group Theory.
Journal of Automata, Languages and Combinatorics, 2014

A weakly universal cellular automaton in the heptagrid with three states.
CoRR, 2014

A weakly universal cellular automaton in the pentagrid with five states.
CoRR, 2014

A note on groups of a family of hyperbolic tessellations.
CoRR, 2014

A Weakly Universal Cellular Automaton on the Heptagrid with Three States.
Proceedings of the Second International Symposium on Computing and Networking, 2014

A Weakly Universal Cellular Automaton in the Pentagrid with Five States.
Proceedings of the Computing with New Resources, 2014

2013
Modeling and Simulation of a Car Race.
J. Cellular Automata, 2013

Cellular Automata and Naive Discrete Lines - I.
J. Cellular Automata, 2013

About Strongly Universal Cellular Automata
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

A proposal for a Chinese keyboard for cellphones, smartphones, ipads and tablets.
CoRR, 2013

Hyperbolic tilings and formal language theory.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

2012
Universal Cellular Automata with Two States in the Hyperbolic Plane.
J. Cellular Automata, 2012

Preface.
Int. J. Found. Comput. Sci., 2012

A family of weakly universal cellular automata in the hyperbolic plane with two states
CoRR, 2012

An application of Grossone to the study of a family of tilings of the hyperbolic plane.
Applied Mathematics and Computation, 2012

Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem.
Proceedings of the Unconventional Computation and Natural Computation, 2012

Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

Modeling and Simulation of a Car Race.
Proceedings of the Cellular Automata, 2012

2011
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states.
Theor. Comput. Sci., 2011

Small Universal Tvdh and Test Tube Systems.
Int. J. Found. Comput. Sci., 2011

Universality of Splicing Test Tube Systems with Two Tubes.
Fundam. Inform., 2011

Using Grossone to count the number of elements of infinite sets and the connection with bijections
CoRR, 2011

An application of Grossone to the study of a family of tilings of the hyperbolic plane
CoRR, 2011

DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification
CoRR, 2011

A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane
CoRR, 2011

Cellular Automata and Discrete Geometry
CoRR, 2011

Coordinates for a new triangular tiling of the hyperbolic plane
CoRR, 2011

A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Bacteria inspired patterns grown with hyperbolic cellular automata.
Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

Cellular automata and discrete geometry.
Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

2010
A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors.
Theory Comput. Syst., 2010

Bacteria inspired patterns grown with hyperbolic cellular automata
CoRR, 2010

An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid
CoRR, 2010

A new weakly universal cellular automaton in the 3D hyperbolic space with two states
CoRR, 2010

About the embedding of one dimensional cellular automata into hyperbolic cellular automata
CoRR, 2010

A weakly universal cellular automaton in the hyperbolic 3D space with three states
CoRR, 2010

Turing Machines with Two Letters and Two States.
Complex Systems, 2010

Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later.
Proceedings of the Membrane Computing, 2010

An Upper Bound on the Number of States for a Strongly Universal Hyperbolic Cellular Automaton on the Pentagrid.
Proceedings of the Second Symposium on Cellular Automata "Journeacute;es Automates Cellulaires", 2010

Computation with competing patterns in Life-like automaton.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

A weakly universal cellular automaton in the hyperbolic 3D space with three states.
Proceedings of the Automata 2010, 2010

Computation with Competing Patterns in Life-Like Automaton.
Proceedings of the Game of Life Cellular Automata., 2010

2009
Cellular Automata in Hyperbolic Spaces.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

A New Universal Cellular Automaton on the Pentagrid.
Parallel Processing Letters, 2009

Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells.
IJUC, 2009

Array P Systems and t.Communication.
Fundam. Inform., 2009

The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable.
Fundam. Inform., 2009

About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane.
Electr. Notes Theor. Comput. Sci., 2009

Surprising Areas in the Quest for Small Universal Devices.
Electr. Notes Theor. Comput. Sci., 2009

About a new splitting for the algorithmic study of the tilings $\{p,q\}$ of the hyperbolic plane when $q$ is odd
CoRR, 2009

Navigation in tilings of the hyperbolic plane and possible applications
CoRR, 2009

Iterative pushdown automata and hyperbolic contour words
CoRR, 2009

A new universal cellular automaton on the ternary heptagrid
CoRR, 2009

The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

2008
Generalized communicating P systems.
Theor. Comput. Sci., 2008

The domino problem of the hyperbolic plane is undecidable.
Theor. Comput. Sci., 2008

A DNA computing inspired computational model.
Theor. Comput. Sci., 2008

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

A Uniform and Intrinsic Proof that there are Universal Cellular Automata in Hyperbolic Spaces.
J. Cellular Automata, 2008

About the domino problem in the hyperbolic plane from an algorithmic point of view.
ITA, 2008

On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane.
Int. J. Found. Comput. Sci., 2008

The Finite Tiling Problem is Undecidable in the Hyperbolic Plane.
Int. J. Found. Comput. Sci., 2008

How to Synchronize the Activity of All Components of a P System?
Int. J. Found. Comput. Sci., 2008

A Universal Cellular Automaton on the Ternary Heptagrid.
Electr. Notes Theor. Comput. Sci., 2008

On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract)
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable
CoRR, 2008

Fast Synchronization in P Systems.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

A new universal cellular automaton on the pentagrid.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

A Proposal for a Japanese Keyboard on Cellular Phones.
Proceedings of the Cellular Automata, 2008

2007
On small universal antiport P systems.
Theor. Comput. Sci., 2007

On Algebraic Structure of Neighborhoods of Cellular AutomataHorse Power Problem.
Fundam. Inform., 2007

Computing by Floating Strings.
Electr. Notes Theor. Comput. Sci., 2007

The Domino Problem of the Hyperbolic Plane is Undecidable.
Bulletin of the EATCS, 2007

Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane.
The Computer Science Journal of Moldova, 2007

The periodic domino problem is undecidable in the hyperbolic plane
CoRR, 2007

The finite tiling problem is undecidable in the hyperbolic plane
CoRR, 2007

On a characterization of cellular automata in tilings of the hyperbolic plane
CoRR, 2007

About the domino problem in the hyperbolic plane, a new solution
CoRR, 2007

Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable?
CoRR, 2007

Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane
CoRR, 2007

The Domino Problem of the Hyperbolic Plane Is Undecidable
CoRR, 2007

About the domino problem in the hyperbolic plane, a new solution: complement
CoRR, 2007

Producer/Consumer in Membrane Systems and Petri Nets.
Proceedings of the Computation and Logic in the Real World, 2007

2006
About an Algorithmic Approach to Tilings {p, q} of the Hyperbolic Plane.
J. UCS, 2006

A Universal Cellular Automaton with Five States in the 3D Hyperbolic Space.
J. Cellular Automata, 2006

On the Communication Between Cells of a Cellular Automaton on the Penta- and Heptagrids of the Hyperbolic Plane.
J. Cellular Automata, 2006

A New Way to Implement Cellular Automata on the Penta- and Heptagrids.
J. Cellular Automata, 2006

Machines, Computations and Universality.
Fundam. Inform., 2006

Substitutions for tilings $\{p,q\}$
CoRR, 2006

On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane
CoRR, 2006

About the domino problem in the hyperbolic plane from an algorithmic point of view
CoRR, 2006

Computational Completeness of Tissue P Systems with Conditional Uniport.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

P Colonies with a Bounded Number of Cells and Programs.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Context-free insertion-deletion systems.
Theor. Comput. Sci., 2005

About Splicing P Systems with One Membrane.
Fundam. Inform., 2005

Time-Varying Distributed H Systems: An Overview.
Fundam. Inform., 2005

On P Systems with Bounded Parallelism.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

2004
The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric.
J. UCS, 2004

Foreword.
IEICE Transactions, 2004

Time and Space Complexity Classes of Hyperbolic Cellular Automata.
IEICE Transactions, 2004

Initialising Cellular Automata in the Hyperbolic Plane.
IEICE Transactions, 2004

Tree Operations in P Systems and lamda-Calculus.
Fundam. Inform., 2004

Register Cellular Automata in the Hyperbolic Plane.
Fundam. Inform., 2004

lambda-P Systems and Typed lambda-Calculus.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Communicative P Systems with Minimal Cooperation.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Palette hyperbolique: un outil pour interagir avec des ensembles de donneacute;es.
Proceedings of the 16th conference on Association Francophone d'Interaction Homme-Machine, 2004

Accepting Hybrid Networks of Evolutionary Processors.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Splicing Systems for Universal Turing Machines.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment.
Proceedings of the Cellular Automata, 2004

2003
A universal cellular automaton in the hyperbolic plane.
Theor. Comput. Sci., 2003

Fibonacci Type Coding for the Regular Rectangular Tilings of the Hyperbolic Plane.
J. UCS, 2003

On the Optimal Number of Instructions for Universal Turing Machines Connected With a Finite Automaton.
IJAC, 2003

Tools for devising cellular automata in the hyperbolic 3D space.
Fundam. Inform., 2003

On the Infinigons of the Hyperbolic Plane, A combinatorial approach.
Fundam. Inform., 2003

Foreword.
Fundam. Inform., 2003

The splitting method and Poincare's theorem: (II) - matrix, polynomial and language.
The Computer Science Journal of Moldova, 2003

Can Hyperbolic Geometry Be of Help for P Systems?.
Proceedings of the Membrane Computing, International Workshop, 2003

P Systems with Cutting/Recombination Rules Assigned to Membranes.
Proceedings of the Membrane Computing, International Workshop, 2003

Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved.
Proceedings of the DNA Computing, 9th International Workshop on DNA Based Computers, 2003

Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Context-Free Insertion-Deletion Systems.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology.
Proceedings of the ISCA 18th International Conference Computers and Their Applications, 2003

2002
Tiling the Hyperbolic Plane with a Single Pentagonal Tile.
J. UCS, 2002

Self-describing Turing machines.
Fundam. Inform., 2002

The splitting method and Poincare's theorem: (I) - the geometric part.
The Computer Science Journal of Moldova, 2002

Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

2001
NP problems are tractable in the space of cellular automata in the hyperbolic plane.
Theor. Comput. Sci., 2001

On quasi-unilateral universal Turing machines.
Theor. Comput. Sci., 2001

Two railway circuits: a universal circuit and an NP-difficult one.
The Computer Science Journal of Moldova, 2001

A Universal Time-Varying Distributed H System of Degree 1.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Computing with Membranes: Variants with an Enhanced Membrane Handling.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages.
Proceedings of the Where Mathematics, 2001

Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Frontier between decidability and undecidability: a survey.
Theor. Comput. Sci., 2000

New Tools for Cellular Automata in the Hyperbolic Plane.
J. UCS, 2000

A package of algorithms to devise cellular automata in the hyperbolic plane and related questions.
The Computer Science Journal of Moldova, 2000

About Time-Varying Distributed H Systems.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999
Nine switch-affine neurons suffice for Turing universality.
Neural Networks, 1999

A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane.
J. UCS, 1999

Universality of Reversible Hexagonal Cellular Automata.
ITA, 1999

1998
Some small self-describing Turing machines.
The Computer Science Journal of Moldova, 1998

Frontier between decidability and undecidability: a survey.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Universality of the Chip-Firing Game.
Theor. Comput. Sci., 1997

The Laterality Problem for Non-Erasing Turing Machines on {0, 1} is Completely Solved.
ITA, 1997

Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996
Foreword: Universal Machines and Computations.
Theor. Comput. Sci., 1996

1995
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality.
Theor. Comput. Sci., 1994

1993
Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

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

1978
On a Variant of Constructivisation of the Theory of Almost Periodic Functions.
Math. Log. Q., 1978


  Loading...