The following pages link to Maurice Margenstern (Q415779):
Displaying 50 items.
- (Q198159) (redirect page) (← links)
- An application of iterative pushdown automata to contour words of balls and truncated balls in hyperbolic tessellations (Q415780) (← links)
- An application of grossone to the study of a family of tilings of the hyperbolic plane (Q440656) (← links)
- A universal cellular automaton on the heptagrid of the hyperbolic plane with four states (Q616492) (← links)
- Infinigons of the hyperbolic plane and grossone (Q671082) (← links)
- Les nombres pratiques: Théorie, observations et conjectures. (Practical numbers: Theory, observations, and conjectures) (Q752051) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- On small universal antiport P systems (Q872200) (← links)
- Fibonacci words, hyperbolic tilings and grossone (Q907192) (← links)
- A DNA computing inspired computational model (Q953543) (← links)
- Generalized communicating P systems (Q953554) (← links)
- The domino problem of the hyperbolic plane is undecidable (Q954981) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane (Q1049728) (← links)
- Constructive functionals in spaces of almost-periodic functions (Q1256467) (← links)
- Some small self-describing Turing machines (Q1279903) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- The splitting method and Poincaré's theorem. I: The geometric part (Q1397632) (← links)
- A universal cellular automaton in the hyperbolic plane. (Q1401276) (← links)
- The splitting method and Poincaré's theorem. II: Matrix, polynomial and language (Q1411557) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Using grossone to count the number of elements of infinite sets and the connection with bijections (Q1760274) (← links)
- Context-free insertion-deletion systems (Q1763721) (← links)
- Small universal cellular automata in hyperbolic spaces. A collection of jewels (Q1946776) (← links)
- Multiple Fibonacci trees (Q2086733) (← links)
- (Q2709220) (← links)
- (Q2770681) (← links)
- An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results (Q2805450) (← links)
- About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane (Q2811952) (← links)
- Computing by Floating Strings (Q2864199) (← links)
- Nikolai Aleksandrovich Shanin (obituary) (Q2868459) (← links)
- Cellular Automata and Hyperbolic Spaces (Q2929340) (← links)
- A Weakly Universal Cellular Automaton in the Pentagrid with Five States (Q2944882) (← links)
- (Q2996237) (← links)
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON (Q3043622) (← links)
- An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later (Q3067483) (← links)
- SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS (Q3076606) (← links)
- Universality of Splicing Test Tube Systems with Two Tubes (Q3100946) (← links)
- (Q3148331) (← links)
- A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States (Q3172875) (← links)
- (Q3197911) (← links)
- (Q3317103) (← links)
- SUR UNE EXTENSION SIMPLE DU CALCUL INTUITIONNISTE DES PREDICATS DU PREMIER ORDRE APPLIQUEE A L'ANALYSE (Q3340854) (← links)
- (Q3396627) (← links)
- The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable (Q3397158) (← links)
- A binomial representation of the 3x + 1 problem (Q4719663) (← links)
- Universality of Reversible Hexagonal Cellular Automata (Q4953340) (← links)
- Surprising Areas in the Quest for Small Universal Devices (Q4982064) (← links)
- A Universal Cellular Automaton on the Ternary Heptagrid (Q4982093) (← links)
- A Weakly Universal Cellular Automaton in the Heptagrid of the Hyperbolic Plane (Q5126848) (← links)
