scientific article; zbMATH DE number 2040939
From MaRDI portal
Publication:4452088
zbMATH Open1040.68062MaRDI QIDQ4452088FDOQ4452088
Authors: M. Margenstern 
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310048.htm
Title of this publication is not available (Why is that?)
Recommendations
- Cellular automata and hyperbolic spaces
- New tools for cellular automata in the hyperbolic plane
- ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
- A package of algorithms to device cellular automata in the hyperbolic plane and related questions
- Towards the frontier between decidability and undecidability for hyperbolic cellular automata
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorial aspects of tessellation and tiling problems (05B45) Cellular automata (computational aspects) (68Q80)
Cited In (22)
- Title not available (Why is that?)
- Cellular automata and hyperbolic spaces
- ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
- Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001.
- A weakly universal cellular automaton in the pentagrid with five states
- An application of iterative pushdown automata to contour words of balls and truncated balls in hyperbolic tessellations
- Small universal cellular automata in hyperbolic spaces. A collection of jewels
- Title not available (Why is that?)
- An application of grossone to the study of a family of tilings of the hyperbolic plane
- Cellular automata in hyperbolic spaces. Vol 1: Theory
- Construction and shape optimization of simplicial meshes in \(d\)-dimensional space
- The domino problem of the hyperbolic plane is undecidable
- A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
- Title not available (Why is that?)
- Fibonacci words, hyperbolic tilings and grossone
- A universal cellular automaton on the ternary heptagrid
- Bacteria, Turing machines and hyperbolic cellular automata
- In some curved spaces, one can solve NP-hard problems in polynomial time
- Polyomino tilings, cellular automata and codicity
- Towards the frontier between decidability and undecidability for hyperbolic cellular automata
- An algorithmic approach to tilings of hyperbolic spaces: universality results
- A package of algorithms to device cellular automata in the hyperbolic plane and related questions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452088)
