default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurice Margenstern
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j86]Maurice Margenstern:
A Strongly Universal Cellular Automaton on the Heptagrid with Six States. Complex Syst. 33(1): 1-30 (2024)- [j85]Maurice Margenstern:
Meadows in the Heptgrid and Possible Generalizations. Comput. Sci. J. Moldova 32(3): 412-424 (2024) - [j84]Maurice Margenstern:
A weakly universal cellular automaton in the heptagrid of the hyperbolic plane. Int. J. Parallel Emergent Distributed Syst. 39(1): 1-31 (2024) - 2023
- [j83]Maurice Margenstern:
The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof. Complex Syst. 32(1): 19-56 (2023) - [i53]Maurice Margenstern:
A weakly universal weighted cellular automaton in the heptagrid with 7 states. CoRR abs/2301.10691 (2023) - [i52]Maurice Margenstern:
A strongly universal cellular automaton on the heptagrif with seven states, new proof. CoRR abs/2304.13575 (2023) - 2022
- [j82]Maurice Margenstern:
A Strongly Universal Cellular Automaton in the Dodecagrid with Five States. Int. J. Unconv. Comput. 17(1-2): 105-157 (2022) - [j81]Maurice Margenstern:
What can we learn from universal Turing machines? Int. J. Parallel Emergent Distributed Syst. 37(2): 123-151 (2022) - [c53]Maurice Margenstern:
Multiple Fibonacci Trees. Automata and Complexity 2022: 283-321 - [i51]Maurice Margenstern:
The domino problem of the hyperbolic plane is undecidable, new proof. CoRR abs/2205.07317 (2022) - 2021
- [j80]Maurice Margenstern:
A Strongly Universal Cellular Automaton on the Heptagrid with Seven States. J. Cell. Autom. 15(5-6): 471-502 (2021) - [i50]Maurice Margenstern:
A strongly universal cellular automaton on the heptagrid with seven states. CoRR abs/2102.04292 (2021) - [i49]Maurice Margenstern:
A strongly universal cellular automaton in the dodecagrid with five states. CoRR abs/2104.01561 (2021) - [i48]Maurice Margenstern:
A strongly universal cellular automaton with four states. CoRR abs/2107.04843 (2021) - [i47]Maurice Margenstern:
An outer totalistic weakly universal cellular automaton in the dodecagrid with four states. CoRR abs/2108.13094 (2021) - [i46]Maurice Margenstern:
What can we learn from universal Turing machines? CoRR abs/2110.08511 (2021)
2010 – 2019
- 2019
- [j79]Maurice Margenstern:
A Decidability Result for the Halting of Cellular Automata on the Pentagrid. Complex Syst. 28(2) (2019) - [p3]Maurice Margenstern:
Constructing Iterated Exponentials in Tilings of the Euclidean and of the Hyperbolic Plane. From Parallel to Emergent Computing 2019: 285-314 - [i45]Maurice Margenstern:
About Fibonacci trees. I. CoRR abs/1904.12135 (2019) - [i44]Maurice Margenstern:
About Fibonacci trees. II - generalized Fibonacci trees. CoRR abs/1907.04677 (2019) - [i43]Maurice Margenstern:
About Fibonacci trees III: multiple Fibonacci trees. CoRR abs/1909.01893 (2019) - 2018
- [j78]Maurice Margenstern:
A Weakly Universal Cellular Automaton in the Heptagrid of the Hyperbolic Plane. Complex Syst. 27(4) (2018) - [j77]Maurice Margenstern:
Navigation tools for cellular automata in two families of tilings of the hyperbolic plane. Int. J. Parallel Emergent Distributed Syst. 33(1): 12-34 (2018) - [p2]Maurice Margenstern:
A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States. Reversibility and Universality 2018: 95-127 - [i42]Maurice Margenstern:
A decidability result for the halting problem of cellular automata in the pentagrid. CoRR abs/1812.03882 (2018) - 2017
- [j76]Maurice Margenstern:
A Weakly Universal Cellular Automaton on the Tessellation {9, 3}. J. Cell. Autom. 12(3-4): 249-284 (2017) - [j75]Maurice Margenstern:
A weakly universal cellular automaton on the pentagrid with two states. Int. J. Parallel Emergent Distributed Syst. 32(4): 309-330 (2017) - 2016
- [j74]Maurice Margenstern:
Infinigons of the hyperbolic plane and grossone. Appl. Math. Comput. 278: 45-53 (2016) - [j73]Maurice Margenstern:
A Weakly Universal Cellular Automaton with 2 States on the Tiling {11, 3}. J. Cell. Autom. 11(2-3): 113-144 (2016) - [i41]Maurice Margenstern:
A new system of coordinates for the tilings $\{p, 3\}$ and $\{p$$-$$2, 4\}$. CoRR abs/1605.03753 (2016) - [i40]Maurice Margenstern:
A weakly universal cellular automaton on the tessellation {9, 3}. CoRR abs/1605.09518 (2016) - [i39]Maurice Margenstern:
A weakly universal universal cellular automaton on the tessellation $\{8, 3\}$. CoRR abs/1606.03938 (2016) - [i38]Maurice Margenstern:
A weakly universal universal cellular automaton in the heptagrid. CoRR abs/1606.09488 (2016) - 2015
- [j72]Maurice Margenstern:
Fibonacci words, hyperbolic tilings and grossone. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 3-11 (2015) - [j71]Svetlana Cojocaru
, Maurice Margenstern, Gheorghe Paun, Sergey Verlan:
Preface. Fundam. Informaticae 138(1-2) (2015) - [j70]Maurice Margenstern:
An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results. Fundam. Informaticae 138(1-2): 113-125 (2015) - [j69]Maurice Margenstern:
Automates cellulaires hyperboliques universels II. Tech. Sci. Informatiques 34(3): 273-310 (2015) - [i37]Maurice Margenstern:
A weakly universal cellular automaton with 2 states on the tiling {11, 3}. CoRR abs/1501.06328 (2015) - [i36]Maurice Margenstern:
Infinigons of the hyperbolic plane and grossone. CoRR abs/1502.07990 (2015) - [i35]Maurice Margenstern:
About embedded quarters and points at infinity in the hyperbolic plane. CoRR abs/1507.08495 (2015) - [i34]Maurice Margenstern:
A weakly universal cellular automaton on the pentagrid with three states. CoRR abs/1510.09129 (2015) - [i33]Maurice Margenstern:
A weakly universal cellular automaton on the pentagrid with two states. CoRR abs/1512.07988 (2015) - 2014
- [j68]Maurice Margenstern:
Pentagrid and Heptagrid: the Fibonacci Technique and Group Theory. J. Autom. Lang. Comb. 19(1-4): 201-212 (2014) - [c52]Maurice Margenstern:
A Weakly Universal Cellular Automaton in the Pentagrid with Five States. Computing with New Resources 2014: 99-113 - [c51]Maurice Margenstern:
A Weakly Universal Cellular Automaton on the Heptagrid with Three States. CANDAR 2014: 11-18 - [i32]Anthony Gasperin, Maurice Margenstern:
A note on groups of a family of hyperbolic tessellations. CoRR abs/1402.4337 (2014) - [i31]Maurice Margenstern:
A weakly universal cellular automaton in the pentagrid with five states. CoRR abs/1403.2373 (2014) - [i30]Maurice Margenstern:
A weakly universal cellular automaton in the heptagrid with three states. CoRR abs/1410.1864 (2014) - 2013
- [j67]Isabelle Debled-Rennesson, Maurice Margenstern:
Cellular Automata and Naive Discrete Lines - I. J. Cell. Autom. 8(1-2): 113-129 (2013) - [j66]Rolf Hoffmann, Maurice Margenstern:
Modeling and Simulation of a Car Race. J. Cell. Autom. 8(5-6): 443-456 (2013) - [c50]Maurice Margenstern:
About Strongly Universal Cellular Automata. MCU 2013: 93-125 - [c49]Maurice Margenstern, K. G. Subramanian:
Hyperbolic tilings and formal language theory. MCU 2013: 126-136 - [i29]Maurice Margenstern, Lan Wu:
A proposal for a Chinese keyboard for cellphones, smartphones, ipads and tablets. CoRR abs/1308.4965 (2013) - 2012
- [j65]Maurice Margenstern:
An application of Grossone to the study of a family of tilings of the hyperbolic plane. Appl. Math. Comput. 218(16): 8005-8018 (2012) - [j64]Jérôme Durand-Lose, Maurice Margenstern, Klaus Sutner:
Preface. Int. J. Found. Comput. Sci. 23(7): 1419-1422 (2012) - [j63]Maurice Margenstern:
Universal Cellular Automata with Two States in the Hyperbolic Plane. J. Cell. Autom. 7(3): 259-284 (2012) - [c48]Rolf Hoffmann, Maurice Margenstern:
Modeling and Simulation of a Car Race. ACRI 2012: 785-794 - [c47]Maurice Margenstern:
Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane. ICCCI (1) 2012: 288-297 - [c46]Maurice Margenstern:
Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem. UCNC 2012: 12-33 - [i28]Maurice Margenstern:
A family of weakly universal cellular automata in the hyperbolic plane with two states. CoRR abs/1202.1709 (2012) - 2011
- [j62]Sergey Verlan, Maurice Margenstern:
Universality of Splicing Test Tube Systems with Two Tubes. Fundam. Informaticae 110(1-4): 329-342 (2011) - [j61]Artiom Alhazov, Marian Kogler, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Small Universal Tvdh and Test Tube Systems. Int. J. Found. Comput. Sci. 22(1): 143-154 (2011) - [j60]Maurice Margenstern:
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theor. Comput. Sci. 412(1-2): 33-56 (2011) - [c45]Maurice Margenstern:
Bacteria inspired patterns grown with hyperbolic cellular automata. HPCS 2011: 757-763 - [c44]Isabelle Debled-Rennesson, Maurice Margenstern:
Cellular automata and discrete geometry. HPCS 2011: 780-786 - [c43]Maurice Margenstern:
A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. RP 2011: 205-217 - [i27]Maurice Margenstern:
Coordinates for a new triangular tiling of the hyperbolic plane. CoRR abs/1101.0530 (2011) - [i26]Isabelle Debled-Rennesson, Maurice Margenstern:
Cellular Automata and Discrete Geometry. CoRR abs/1102.2315 (2011) - [i25]Maurice Margenstern:
A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane. CoRR abs/1103.5119 (2011) - [i24]Maurice Margenstern, Pascal Mayer, Sergey Verlan:
DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification. CoRR abs/1105.1424 (2011) - [i23]Maurice Margenstern:
An application of Grossone to the study of a family of tilings of the hyperbolic plane. CoRR abs/1106.2217 (2011) - [i22]Maurice Margenstern:
Using Grossone to count the number of elements of infinite sets and the connection with bijections. CoRR abs/1106.2290 (2011) - 2010
- [j59]Maurice Margenstern:
Turing Machines with Two Letters and Two States. Complex Syst. 19(1) (2010) - [j58]Florin Manea, Maurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez:
A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. Theory Comput. Syst. 46(2): 174-192 (2010) - [c42]Maurice Margenstern:
A weakly universal cellular automaton in the hyperbolic 3D space with three states. Automata 2010: 91-110 - [c41]Genaro Juárez Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern:
Computation with competing patterns in Life-like automaton. HPCS 2010: 564 - [c40]Maurice Margenstern:
An Upper Bound on the Number of States for a Strongly Universal Hyperbolic Cellular Automaton on the Pentagrid. JAC 2010: 168-179 - [c39]Maurice Margenstern:
An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later. Int. Conf. on Membrane Computing 2010: 37-52 - [c38]Maurice Margenstern:
Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. RP 2010: 120-132 - [c37]Genaro Juárez Martínez, Kenichi Morita, Andrew Adamatzky, Maurice Margenstern:
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345. UC 2010: 93-104 - [p1]Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern:
Computation with Competing Patterns in Life-Like Automaton. Game of Life Cellular Automata 2010: 547-572 - [i21]Maurice Margenstern:
A weakly universal cellular automaton in the hyperbolic 3D space with three states. CoRR abs/1002.4290 (2010) - [i20]Maurice Margenstern:
About the embedding of one dimensional cellular automata into hyperbolic cellular automata. CoRR abs/1004.1830 (2010) - [i19]Maurice Margenstern:
A new weakly universal cellular automaton in the 3D hyperbolic space with two states. CoRR abs/1005.4826 (2010) - [i18]Maurice Margenstern:
An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid. CoRR abs/1006.3451 (2010) - [i17]Maurice Margenstern:
Bacteria inspired patterns grown with hyperbolic cellular automata. CoRR abs/1012.2771 (2010)
2000 – 2009
- 2009
- [j57]K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern:
Array P Systems and t.Communication. Fundam. Informaticae 91(1): 145-159 (2009) - [j56]Maurice Margenstern:
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable. Fundam. Informaticae 94(1): 63-99 (2009) - [j55]Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan:
Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells. Int. J. Unconv. Comput. 5(5): 391-409 (2009) - [j54]Maurice Margenstern, Yu Song:
A New Universal Cellular Automaton on the Pentagrid. Parallel Process. Lett. 19(2): 227-246 (2009) - [c36]Maurice Margenstern:
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. RP 2009: 154-165 - [c35]Maurice Margenstern:
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane. AUTOMATA 2009: 93-102 - [r1]Maurice Margenstern:
Cellular Automata in Hyperbolic Spaces. Encyclopedia of Complexity and Systems Science 2009: 791-800 - [i16]Maurice Margenstern:
A new universal cellular automaton on the ternary heptagrid. CoRR abs/0903.2108 (2009) - [i15]Maurice Margenstern:
Iterative pushdown automata and hyperbolic contour words. CoRR abs/0907.4957 (2009) - [i14]Maurice Margenstern:
Navigation in tilings of the hyperbolic plane and possible applications. CoRR abs/0909.2157 (2009) - [i13]Maurice Margenstern:
About a new splitting for the algorithmic study of the tilings $\{p,q\}$ of the hyperbolic plane when $q$ is odd. CoRR abs/0911.4040 (2009) - 2008
- [j53]Maurice Margenstern:
The Finite Tiling Problem is Undecidable in the Hyperbolic Plane. Int. J. Found. Comput. Sci. 19(4): 971-982 (2008) - [j52]Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan:
How to Synchronize the Activity of All Components of a P System? Int. J. Found. Comput. Sci. 19(5): 1183-1198 (2008) - [j51]Maurice Margenstern:
On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane. Int. J. Found. Comput. Sci. 19(5): 1235-1257 (2008) - [j50]Maurice Margenstern:
About the domino problem in the hyperbolic plane from an algorithmic point of view. RAIRO Theor. Informatics Appl. 42(1): 21-36 (2008) - [j49]Maurice Margenstern:
A Uniform and Intrinsic Proof that there are Universal Cellular Automata in Hyperbolic Spaces. J. Cell. Autom. 3(2): 157-180 (2008) - [j48]Maurice Margenstern:
Research Notices: The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. SIGACT News 39(3): 40 (2008) - [j47]Giuditta Franco, Maurice Margenstern:
A DNA computing inspired computational model. Theor. Comput. Sci. 404(1-2): 88-96 (2008) - [j46]Sergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern:
Generalized communicating P systems. Theor. Comput. Sci. 404(1-2): 170-184 (2008) - [j45]Maurice Margenstern:
The domino problem of the hyperbolic plane is undecidable. Theor. Comput. Sci. 407(1-3): 29-84 (2008) - [c34]Maurice Margenstern, Benoît Martin, Hiroshi Umeo, Shogo Yamano, Kazuhiro Nishioka:
A Proposal for a Japanese Keyboard on Cellular Phones. ACRI 2008: 299-306 - [c33]Maurice Margenstern, Yu Song:
A new universal cellular automaton on the pentagrid. Automata 2008: 36-54 - [c32]Artiom Alhazov, Maurice Margenstern, Sergey Verlan:
Fast Synchronization in P Systems. Workshop on Membrane Computing 2008: 118-128 - [c31]Maurice Margenstern:
On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract). CSP 2008: 153-163 - [c30]Maurice Margenstern, Yu Song:
A Universal Cellular Automaton on the Ternary Heptagrid. RP 2008: 167-185 - [i12]Maurice Margenstern:
The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. CoRR abs/0806.1602 (2008) - 2007
- [j44]Maurice Margenstern:
Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane. Comput. Sci. J. Moldova 15(3): 247-277 (2007) - [j43]Maurice Margenstern:
The Domino Problem of the Hyperbolic Plane is Undecidable. Bull. EATCS 93: 237 (2007) - [j42]Hidenosuke Nishio, Maurice Margenstern, Friedrich von Haeseler:
On Algebraic Structure of Neighborhoods of Cellular AutomataHorse Power Problem. Fundam. Informaticae 78(3): 397-416 (2007) - [j41]Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil, Sergey Verlan:
On small universal antiport P systems. Theor. Comput. Sci. 372(2-3): 152-164 (2007) - [c29]Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan:
Producer/Consumer in Membrane Systems and Petri Nets. CiE 2007: 43-52 - [e5]Jérôme Olivier Durand-Lose, Maurice Margenstern:
Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science 4664, Springer 2007, ISBN 978-3-540-74592-1 [contents] - [i11]Maurice Margenstern:
About the domino problem in the hyperbolic plane, a new solution: complement. CoRR abs/0705.0086 (2007) - [i10]Maurice Margenstern:
The Domino Problem of the Hyperbolic Plane Is Undecidable. CoRR abs/0706.4161 (2007) - [i9]Maurice Margenstern:
Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane. CoRR abs/0710.0232 (2007) - [i8]Maurice Margenstern:
Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? CoRR abs/0712.2577 (2007) - [i7]Maurice Margenstern:
About the domino problem in the hyperbolic plane, a new solution. CoRR abs/cs/0701096 (2007) - [i6]Maurice Margenstern:
On a characterization of cellular automata in tilings of the hyperbolic plane. CoRR abs/cs/0702155 (2007) - [i5]Maurice Margenstern:
The finite tiling problem is undecidable in the hyperbolic plane. CoRR abs/cs/0703147 (2007) - [i4]Maurice Margenstern:
The periodic domino problem is undecidable in the hyperbolic plane. CoRR abs/cs/0703153 (2007) - 2006
- [j40]Maurice Margenstern:
Machines, Computations and Universality. Fundam. Informaticae 74(4) (2006) - [j39]Maurice Margenstern:
A New Way to Implement Cellular Automata on the Penta- and Heptagrids. J. Cell. Autom. 1(1): 1-24 (2006) - [j38]Maurice Margenstern:
On the Communication Between Cells of a Cellular Automaton on the Penta- and Heptagrids of the Hyperbolic Plane. J. Cell. Autom. 1(3): 213-232 (2006) - [j37]Maurice Margenstern:
A Universal Cellular Automaton with Five States in the 3D Hyperbolic Space. J. Cell. Autom. 1(4): 317-351 (2006) - [j36]Maurice Margenstern:
About an Algorithmic Approach to Tilings {p, q} of the Hyperbolic Plane. J. Univers. Comput. Sci. 12(5): 512-550 (2006) - [c28]Maurice Margenstern:
An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces. FCS 2006: 3-9 - [c27]Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil:
P Colonies with a Bounded Number of Cells and Programs. Workshop on Membrane Computing 2006: 352-366 - [c26]Sergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern:
Computational Completeness of Tissue P Systems with Conditional Uniport. Workshop on Membrane Computing 2006: 521-535 - [c25]Giuditta Franco, Maurice Margenstern:
Computing by Floating Strings. MeCBIC@ICALP 2006: 95-104 - [c24]Maurice Margenstern:
Surprising Areas in the Quest for Small Universal Devices. MFCSIT 2006: 201-220 - [i3]Maurice Margenstern:
About the domino problem in the hyperbolic plane from an algorithmic point of view. CoRR abs/cs/0603093 (2006) - [i2]Maurice Margenstern:
On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane. CoRR abs/cs/0606012 (2006) - [i1]Maurice Margenstern, Guentcho Skordev:
Substitutions for tilings $\{p,q\}$. CoRR abs/cs/0611039 (2006) - 2005
- [j35]Maurice Margenstern, Sergey Verlan, Yurii Rogozhin:
Time-Varying Distributed H Systems: An Overview. Fundam. Informaticae 64(1-4): 291-306 (2005) - [j34]Sergey Verlan, Maurice Margenstern:
About Splicing P Systems with One Membrane. Fundam. Informaticae 65(3): 279-290 (2005) - [j33]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2): 339-348 (2005) - [c23]Francesco Bernardini, Francisco José Romero-Campero, Marian Gheorghe, Mario J. Pérez-Jiménez, Maurice Margenstern, Sergey Verlan, Natalio Krasnogor:
On P Systems with Bounded Parallelism. SYNASC 2005: 399-406 - [e4]Maurice Margenstern:
Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3354, Springer 2005, ISBN 3-540-25261-4 [contents] - 2004
- [j32]Natasa Jonoska, Maurice Margenstern:
Tree Operations in P Systems and lamda-Calculus. Fundam. Informaticae 59(1): 67-90 (2004) - [j31]Serge Grigorieff, Maurice Margenstern:
Register Cellular Automata in the Hyperbolic Plane. Fundam. Informaticae 61(1): 19-27 (2004) - [j30]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo:
Foreword. IEICE Trans. Inf. Syst. 87-D(3): 647-649 (2004) - [j29]Kamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci:
Initialising Cellular Automata in the Hyperbolic Plane. IEICE Trans. Inf. Syst. 87-D(3): 677-686 (2004) - [j28]Chuzo Iwamoto, Maurice Margenstern:
Time and Space Complexity Classes of Hyperbolic Cellular Automata. IEICE Trans. Inf. Syst. 87-D(3): 700-707 (2004) - [j27]Maurice Margenstern:
The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric. J. Univers. Comput. Sci. 10(9): 1212-1238 (2004) - [c22]Kamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci:
Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment. ACRI 2004: 678-687 - [c21]Tero Harju, Maurice Margenstern:
Splicing Systems for Universal Turing Machines. DNA 2004: 149-158 - [c20]Maurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez:
Accepting Hybrid Networks of Evolutionary Processors. DNA 2004: 235-246 - [c19]Kamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci:
Palette hyperbolique: un outil pour interagir avec des ensembles de données. IHM 2004: 195-198 - [c18]Loïc Colson, Natasa Jonoska, Maurice Margenstern:
lambda-P Systems and Typed lambda-Calculus. Workshop on Membrane Computing 2004: 1-18 - [c17]Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan:
Communicative P Systems with Minimal Cooperation. Workshop on Membrane Computing 2004: 161-177 - 2003
- [j26]Maurice Margenstern:
The splitting method and Poincare's theorem: (II) - matrix, polynomial and language. Comput. Sci. J. Moldova 11(1): 3-27 (2003) - [j25]Maurice Margenstern:
On the Infinigons of the Hyperbolic Plane, A combinatorial approach. Fundam. Informaticae 56(3): 255-272 (2003) - [j24]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo:
Foreword. Fundam. Informaticae 58(2003) (2003) - [j23]Maurice Margenstern, Guentcho Skordev:
Tools for devising cellular automata in the hyperbolic 3D space. Fundam. Informaticae 58(2003): 369-398 (2003) - [j22]Maurice Margenstern, Lioudmila Pavlotskaïa:
On the Optimal Number of Instructions for Universal Turing Machines Connected With a Finite Automaton. Int. J. Algebra Comput. 13(2): 133-202 (2003) - [j21]Maurice Margenstern, Guentcho Skordev:
Fibonacci Type Coding for the Regular Rectangular Tilings of the Hyperbolic Plane. J. Univers. Comput. Sci. 9(5): 398-422 (2003) - [j20]Francine Herrmann, Maurice Margenstern:
A universal cellular automaton in the hyperbolic plane. Theor. Comput. Sci. 296(2): 327-364 (2003) - [c16]Maurice Margenstern:
A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology. CATA 2003: 468-471 - [c15]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-Free Insertion-Deletion Systems. DCFS 2003: 265-273 - [c14]Maurice Margenstern:
Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. DMTCS 2003: 48-72 - [c13]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. DNA 2003: 48-53 - [c12]Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202 - [c11]Maurice Margenstern:
Can Hyperbolic Geometry Be of Help for P Systems?. Workshop on Membrane Computing 2003: 240-249 - 2002
- [j19]Maurice Margenstern:
The splitting method and Poincare's theorem: (I) - the geometric part. Comput. Sci. J. Moldova 10(3): 297-319 (2002) - [j18]Maurice Margenstern, Yurii Rogozhin:
Self-describing Turing machines. Fundam. Informaticae 50(3-4): 285-303 (2002) - [j17]Maurice Margenstern:
Tiling the Hyperbolic Plane with a Single Pentagonal Tile. J. Univers. Comput. Sci. 8(2): 297-316 (2002) - [c10]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. DNA 2002: 326-336 - 2001
- [j16]Maurice Margenstern:
Two railway circuits: a universal circuit and an NP-difficult one. Comput. Sci. J. Moldova 9(1): 3-19 (2001) - [j15]Maurice Margenstern:
On quasi-unilateral universal Turing machines. Theor. Comput. Sci. 257(1-2): 153-166 (2001) - [j14]Maurice Margenstern, Kenichi Morita:
NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor. Comput. Sci. 259(1-2): 99-128 (2001) - [c9]Maurice Margenstern, Yurii Rogozhin:
Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages. Words, Semigroups, and Transductions 2001: 329-339 - [c8]Maurice Margenstern, Yurii Rogozhin:
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 399-407 - [c7]Maurice Margenstern, Carlos Martín-Vide, Gheorghe Paun:
Computing with Membranes: Variants with an Enhanced Membrane Handling. DNA 2001: 340-349 - [c6]Maurice Margenstern, Yurii Rogozhin:
A Universal Time-Varying Distributed H System of Degree 1. DNA 2001: 371-380 - [e3]Maurice Margenstern, Yurii Rogozhin:
Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldova, May 23-27, 2001, Proceedings. Lecture Notes in Computer Science 2055, Springer 2001, ISBN 3-540-42121-1 [contents] - 2000
- [j13]Maurice Margenstern:
A package of algorithms to devise cellular automata in the hyperbolic plane and related questions. Comput. Sci. J. Moldova 8(2): 95-115 (2000) - [j12]Maurice Margenstern:
New Tools for Cellular Automata in the Hyperbolic Plane. J. Univers. Comput. Sci. 6(12): 1226-1252 (2000) - [j11]Maurice Margenstern:
Frontier between decidability and undecidability: a survey. Theor. Comput. Sci. 231(2): 217-251 (2000) - [c5]Maurice Margenstern, Yurii Rogozhin:
About Time-Varying Distributed H Systems. DNA Computing 2000: 53-62
1990 – 1999
- 1999
- [j10]Kenichi Morita, Maurice Margenstern, Katsunobu Imai:
Universality of Reversible Hexagonal Cellular Automata. RAIRO Theor. Informatics Appl. 33(6): 535-550 (1999) - [j9]Maurice Margenstern, Kenichi Morita:
A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. J. Univers. Comput. Sci. 5(9): 563-573 (1999) - [j8]Hava T. Siegelmann, Maurice Margenstern:
Nine switch-affine neurons suffice for Turing universality. Neural Networks 12(4-5): 593-600 (1999) - 1998
- [j7]Maurice Margenstern, Iurie Rogojin:
Some small self-describing Turing machines. Comput. Sci. J. Moldova 6(1): 57-82 (1998) - [c4]Maurice Margenstern:
Frontier between decidability and undecidability: a survey. MCU (1) 1998: 141-177 - [e2]Maurice Margenstern:
International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedings, Volume I. IUT Metz 1998, ISBN 2-9511539-2-9 [contents] - [e1]Maurice Margenstern:
International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedingsi, Volume II. IUT Metz 1998, ISBN 2-9511539-1-0 [contents] - 1997
- [j6]Maurice Margenstern:
The Laterality Problem for Non-Erasing Turing Machines on {0, 1} is Completely Solved. RAIRO Theor. Informatics Appl. 31(2): 159-204 (1997) - [j5]Eric Goles Ch., Maurice Margenstern:
Universality of the Chip-Firing Game. Theor. Comput. Sci. 172(1-2): 121-134 (1997) - [c3]Maurice Margenstern:
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. LFCS 1997: 226-236 - 1996
- [j4]Maurice Margenstern:
Foreword: Universal Machines and Computations. Theor. Comput. Sci. 168(2): 213-214 (1996) - 1995
- [c2]Maurice Margenstern:
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. LATIN 1995: 386-397 - 1994
- [j3]Maurice Margenstern:
Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. Theor. Comput. Sci. 129(2): 419-424 (1994) - 1993
- [c1]Maurice Margenstern:
Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. FCT 1993: 375-385
1980 – 1989
- 1984
- [j2]Maurice Margenstern:
Sur une Extension Simple du calcul intuitionniste des predicats du premier ordre Appliquee a L'analyse. Math. Log. Q. 30(19-24): 317-324 (1984)
1970 – 1979
- 1978
- [j1]Maurice Margenstern:
On a Variant of Constructivisation of the Theory of Almost Periodic Functions. Math. Log. Q. 24(31-36): 495-507 (1978)
Coauthor Index
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.
last updated on 2025-03-04 22:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
