The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maurice Margenstern: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci
    Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment. [Citation Graph (0, 0)][DBLP]
    ACRI, 2004, pp:678-687 [Conf]
  2. Maurice Margenstern, Yurii Rogozhin
    Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:329-339 [Conf]
  3. Maurice Margenstern
    A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2003, pp:468-471 [Conf]
  4. Maurice Margenstern
    Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:48-72 [Conf]
  5. Maurice Margenstern, Yurii Rogozhin
    About Time-Varying Distributed H Systems. [Citation Graph (0, 0)][DBLP]
    DNA Computing, 2000, pp:53-62 [Conf]
  6. Maurice Margenstern, Yurii Rogozhin
    A Universal Time-Varying Distributed H System of Degree 1. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:371-380 [Conf]
  7. Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
    Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:326-336 [Conf]
  8. Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
    Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. [Citation Graph (0, 0)][DBLP]
    DNA, 2003, pp:48-53 [Conf]
  9. Maurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez
    Accepting Hybrid Networks of Evolutionary Processors. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:235-246 [Conf]
  10. Tero Harju, Maurice Margenstern
    Splicing Systems for Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:149-158 [Conf]
  11. Maurice Margenstern, Carlos Martín-Vide, Gheorghe Paun
    Computing with Membranes: Variants with an Enhanced Membrane Handling. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:340-349 [Conf]
  12. Maurice Margenstern
    An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces. [Citation Graph (0, 0)][DBLP]
    FCS, 2006, pp:3-9 [Conf]
  13. Maurice Margenstern
    Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:375-385 [Conf]
  14. Maurice Margenstern
    Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:386-397 [Conf]
  15. Maurice Margenstern
    Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:226-236 [Conf]
  16. Maurice Margenstern
    Frontier between decidability and undecidability: a survey. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:141-177 [Conf]
  17. Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan
    Communicative P Systems with Minimal Cooperation. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:161-177 [Conf]
  18. Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil
    P Colonies with a Bounded Number of Cells and Programs. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:352-366 [Conf]
  19. Maurice Margenstern
    Can Hyperbolic Geometry Be of Help for P Systems?. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2003, pp:240-249 [Conf]
  20. Loïc Colson, Natasa Jonoska, Maurice Margenstern
    lambda-P Systems and Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:1-18 [Conf]
  21. Sergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern
    Computational Completeness of Tissue P Systems with Conditional Uniport. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:521-535 [Conf]
  22. Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
    P Systems with Cutting/Recombination Rules Assigned to Membranes. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2003, pp:191-202 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2005, pp:399-406 [Conf]
  24. Serge Grigorieff, Maurice Margenstern
    Register Cellular Automata in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:61, n:1, pp:19-27 [Journal]
  25. Natasa Jonoska, Maurice Margenstern
    Tree Operations in P Systems and lamda-Calculus. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:59, n:1, pp:67-90 [Journal]
  26. Martin Kutrib, Maurice Margenstern, Hiroshi Umeo
    Foreword. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:- [Journal]
  27. Maurice Margenstern, Yurii Rogozhin
    Self-describing Turing machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:3-4, pp:285-303 [Journal]
  28. Maurice Margenstern
    On the Infinigons of the Hyperbolic Plane, A combinatorial approach. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:3, pp:255-272 [Journal]
  29. Maurice Margenstern, Guentcho Skordev
    Tools for devising cellular automata in the hyperbolic 3D space. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:369-398 [Journal]
  30. Maurice Margenstern, Sergey Verlan, Yurii Rogozhin
    Time-Varying Distributed H Systems: An Overview. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:291-306 [Journal]
  31. Sergey Verlan, Maurice Margenstern
    About Splicing P Systems with One Membrane. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:65, n:3, pp:279-290 [Journal]
  32. Maurice Margenstern
    Machines, Computations and Universality. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:4, pp:- [Journal]
  33. Maurice Margenstern, Lioudmila Pavlotskaïa
    On the Optimal Number of Instructions for Universal Turing Machines Connected With a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    IJAC, 2003, v:13, n:2, pp:133-202 [Journal]
  34. Maurice Margenstern
    The Laterality Problem for Non-Erasing Turing Machines on {0, 1} is Completely Solved. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:2, pp:159-204 [Journal]
  35. Kenichi Morita, Maurice Margenstern, Katsunobu Imai
    Universality of Reversible Hexagonal Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:6, pp:535-550 [Journal]
  36. Maurice Margenstern
    New Tools for Cellular Automata in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:12, pp:1226-1252 [Journal]
  37. Maurice Margenstern
    Tiling the Hyperbolic Plane with a Single Pentagonal Tile. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:297-316 [Journal]
  38. Maurice Margenstern
    The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2004, v:10, n:9, pp:1212-1238 [Journal]
  39. Maurice Margenstern, Kenichi Morita
    A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:9, pp:563-573 [Journal]
  40. Maurice Margenstern, Guentcho Skordev
    Fibonacci Type Coding for the Regular Rectangular Tilings of the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2003, v:9, n:5, pp:398-422 [Journal]
  41. Maurice Margenstern
    About an Algorithmic Approach to Tilings {p, q} of the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:5, pp:512-550 [Journal]
  42. Hava T. Siegelmann, Maurice Margenstern
    Nine switch-affine neurons suffice for Turing universality. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1999, v:12, n:4-5, pp:593-600 [Journal]
  43. Eric Goles Ch., Maurice Margenstern
    Universality of the Chip-Firing Game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:121-134 [Journal]
  44. Francine Herrmann, Maurice Margenstern
    A universal cellular automaton in the hyperbolic plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:296, pp:327-364 [Journal]
  45. Maurice Margenstern
    Frontier between decidability and undecidability: a survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:217-251 [Journal]
  46. Maurice Margenstern
    On quasi-unilateral universal Turing machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:257, n:1-2, pp:153-166 [Journal]
  47. Maurice Margenstern
    Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:129, n:2, pp:419-424 [Journal]
  48. Maurice Margenstern
    Foreword: Universal Machines and Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:2, pp:213-214 [Journal]
  49. Maurice Margenstern, Kenichi Morita
    NP problems are tractable in the space of cellular automata in the hyperbolic plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:99-128 [Journal]
  50. Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan
    Context-free insertion-deletion systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:339-348 [Journal]
  51. Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil, Sergey Verlan
    On small universal antiport P systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:2-3, pp:152-164 [Journal]
  52. Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan
    Producer/Consumer in Membrane Systems and Petri Nets. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:43-52 [Conf]
  53. Maurice Margenstern
    About the domino problem in the hyperbolic plane, a new solution [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  54. Maurice Margenstern
    On a characterization of cellular automata in tilings of the hyperbolic plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  55. Maurice Margenstern
    The finite tiling problem is undecidable in the hyperbolic plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  56. Maurice Margenstern
    The periodic domino problem is undecidable in the hyperbolic plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  57. Maurice Margenstern
    About the domino problem in the hyperbolic plane, a new solution: complement [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  58. Maurice Margenstern
    The Domino Problem of the Hyperbolic Plane Is Undecidable [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  59. Maurice Margenstern, Guentcho Skordev
    Substitutions for tilings $\{p,q\}$ [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  60. Maurice Margenstern
    About the domino problem in the hyperbolic plane from an algorithmic point of view [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  61. Maurice Margenstern
    On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  62. Maurice Margenstern
    Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  63. Giuditta Franco, Maurice Margenstern
    Computing by Floating Strings. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:171, n:2, pp:95-104 [Journal]
  64. Hidenosuke Nishio, Maurice Margenstern, Friedrich von Haeseler
    On Algebraic Structure of Neighborhoods of Cellular AutomataHorse Power Problem. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:78, n:3, pp:397-416 [Journal]

  65. A Proposal for a Japanese Keyboard on Cellular Phones. [Citation Graph (, )][DBLP]


  66. Fast Synchronization in P Systems. [Citation Graph (, )][DBLP]


  67. Palette hyperbolique: un outil pour interagir avec des ensembles de donneacute;es. [Citation Graph (, )][DBLP]


  68. The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. [Citation Graph (, )][DBLP]


  69. Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. [Citation Graph (, )][DBLP]


  70. Computation with competing patterns in Life-like automaton. [Citation Graph (, )][DBLP]


  71. Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? [Citation Graph (, )][DBLP]


  72. The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable [Citation Graph (, )][DBLP]


  73. A new universal cellular automaton on the ternary heptagrid [Citation Graph (, )][DBLP]


  74. On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract) [Citation Graph (, )][DBLP]


  75. Iterative pushdown automata and hyperbolic contour words [Citation Graph (, )][DBLP]


  76. Navigation in tilings of the hyperbolic plane and possible applications [Citation Graph (, )][DBLP]


  77. About a new splitting for the algorithmic study of the tilings $\{p,q\}$ of the hyperbolic plane when $q$ is odd [Citation Graph (, )][DBLP]


  78. A weakly universal cellular automaton in the hyperbolic 3D space with three states [Citation Graph (, )][DBLP]


  79. About the embedding of one dimensional cellular automata into hyperbolic cellular automata [Citation Graph (, )][DBLP]


  80. A new weakly universal cellular automaton in the 3D hyperbolic space with two states [Citation Graph (, )][DBLP]


  81. An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid [Citation Graph (, )][DBLP]


  82. A Universal Cellular Automaton on the Ternary Heptagrid. [Citation Graph (, )][DBLP]


  83. Surprising Areas in the Quest for Small Universal Devices. [Citation Graph (, )][DBLP]


  84. About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane. [Citation Graph (, )][DBLP]


Search in 0.371secs, Finished in 0.375secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002