About the domino problem in the hyperbolic plane, a new solution: complement
arXiv:0705.0086 · doi:10.1016/j.tcs.2008.04.038
Abstract
In this paper, we complete the construction of paper arXiv:cs.CG/0701096v2. Together with the proof contained in arXiv:cs.CG/0701096v2, this paper definitely proves that the general problem of tiling the hyperbolic plane with {\it à la} Wang tiles is undecidable.
20 pages
References in corpus (4)
Cited by in corpus (10)
- About the domino problem in the hyperbolic plane, a new solution: complement
- Tiling Problems on Baumslag-Solitar groups
- Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic
- The domino problem on groups of polynomial growth
- A family of weakly universal cellular automata in the hyperbolic plane with two states
- Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane
- Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable?
- On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract)
- Row-constrained effective sets of colourings in the -fold horocyclic tessellations of are sofic
- Undecidability of tiling the plane with a fixed number of Wang bars