research
∙
03/20/2023
Sturmian and infinitely desubstitutable words accepted by an ω-automaton
Given an ω-automaton and a set of substitutions, we look at which accept...
share
research
∙
02/23/2023
The Domino problem is undecidable on every rhombus subshift
We extend the classical Domino problem to any tiling of rhombus-shaped t...
research
∙
02/15/2022
The aperiodic Domino problem in higher dimension
The classical Domino problem asks whether there exists a tiling in which...
research
∙
06/03/2018
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
In this paper, we provide polynomial-time algorithms for different exten...
research
∙
05/22/2018
