An Intriguing Tiling Problem

This talk introduces some simple tiling problems. Their decidability is open. These problems are tightly related to the decidability of some quantitative variants of MSO over infinite words. The technical content of this talk is part of a collaboration with Achim Blumensath and Olivier Carton that will be presented at MFCS '14. 17: 00 17: 15 Break

Authors

• Thomas Colcombet

Keywords

No keywords are indexed for this paper.