Zobrazeno 1 - 10
of 221
pro vyhledávání: '"Gamard, A"'
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every arborescent monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations are Boolean
Externí odkaz:
http://arxiv.org/abs/2302.04522
Publikováno v:
Main Group Metal Chemistry, Vol 25, Iss 1-2, Pp 59-66 (2002)
Externí odkaz:
https://doaj.org/article/df5c219cf3ac4574861030fe0c3a55d2
Autor:
Gamard, Guilhem
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 of w. A subshift is said to have the cover q if each of its points has
Externí odkaz:
http://arxiv.org/abs/1812.08022
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 passage to the biinfinite case could help to prove stronger results about
Externí odkaz:
http://arxiv.org/abs/1803.02643
Clark has defined the notion of $n$-avoidance basis which contains the avoidable formulas with at most $n$ variables that are closest to be unavoidable in some sense. The family $C_i$ of circular formulas is such that $C_1=AA$, $C_2=ABA.BAB$, $C_3=AB
Externí odkaz:
http://arxiv.org/abs/1610.04439
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 cannot be expressed as the repetition of smaller arrays). We count the numb
Externí odkaz:
http://arxiv.org/abs/1602.06915
Autor:
Gamard, Guilhem, Richomme, Gwenaël
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 coverable) if it has infinitely many different quasiperiods. These notion
Externí odkaz:
http://arxiv.org/abs/1506.08375
Publikováno v:
In European Journal of Combinatorics March 2020 85
In this paper we present a construction of Kari-Culik aperiodic tile set - the smallest known until now. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected.
Externí odkaz:
http://arxiv.org/abs/1312.4126
Autor:
Gamard, Guilhem, Richomme, Gwenaël
Publikováno v:
In Journal of Computer and System Sciences September 2019 104:258-277