9 citations · 11 across the 7 of their papers we have counts for
7 papers
Hardness of monadic second-order formulae over succinct graphs
Guilhem Gamard, Aliénor Goubault-Larrecq, Pierre Guillon +3
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graph…
On the entropy of coverable subshifts
Guilhem Gamard
A coloration w of Z^2 is said to be coverable if there exists a rectangular block q such that w is covered with occurrences of q, possibly overlapping. In this case, q is a cover o…
Quasiperiods of biinfinite Sturmian words
Florian Barbero, Guilhem Gamard, Anaël Grandjean
We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the pas…
Avoidability of circular formulas
Guilhem Gamard, Pascal Ochem, Gwenaël Richomme +1
Clark has defined the notion of -avoidance basis which contains the avoidable formulas with at most variables that are closest to be unavoidable in some sense. The family $C…
Periodicity in Rectangular Arrays
Guilhem Gamard, Gwenaël Richomme, Jeffrey Shallit +1
We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that canno…
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions
Guilhem Gamard, Gwenaël Richomme
A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale cov…