Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Gamard, Guilhem
43  Ergebnisse:
Personensuche X
?
1

Quasiperiods of biinfinite words:

Barbero, Florian ; Gamard, Guilhem ; Grandjean, Anaël
European Journal of Combinatorics.  85 (2020)  - p. 103046 , 2020
Link: https://doi.org/10.1016/..
 
?
2

Coverability and multi-scale coverability on infinite pictu..:

Gamard, Guilhem ; Richomme, Gwenaël
Journal of Computer and System Sciences.  104 (2019)  - p. 258-277 , 2019
Link: https://doi.org/10.1016/..
 
?
3

Avoidability of circular formulas:

Gamard, Guilhem ; Ochem, Pascal ; Richomme, Gwenaël.
Theoretical Computer Science.  726 (2018)  - p. 1-4 , 2018
Link: https://doi.org/10.1016/..
 
?
4

Periodicity in rectangular arrays:

Gamard, Guilhem ; Richomme, Gwenaël ; Shallit, Jeffrey.
Information Processing Letters.  118 (2017)  - p. 58-63 , 2017
Link: https://doi.org/10.1016/..
 
?
5

Aperiodic tilings and entropy:

Durand, Bruno ; Gamard, Guilhem ; Grandjean, Anaël
Theoretical Computer Science.  666 (2017)  - p. 36-47 , 2017
Link: https://doi.org/10.1016/..
 
?
6

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
http://arxiv.org/abs/2302.04522.  , 2023
Link: http://arxiv.org/abs/230..
 
?
7

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
info:eu-repo/semantics/altIdentifier/arxiv/2302.04522.  , 2023
Link: https://hal.science/hal-..
 
?
8

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
info:eu-repo/semantics/altIdentifier/arxiv/2302.04522.  , 2023
Link: https://hal.science/hal-..
 
?
9

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
info:eu-repo/semantics/altIdentifier/arxiv/2302.04522.  , 2023
Link: https://hal.science/hal-..
 
?
10

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
info:eu-repo/semantics/altIdentifier/arxiv/2302.04522.  , 2023
Link: https://hal.science/hal-..
 
?
11

Hardness of monadic second-order formulae over succinct gra..:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kévin.
info:eu-repo/semantics/altIdentifier/arxiv/2302.04522.  , 2023
Link: https://hal.science/hal-..
 
?
12

Rice-Like Theorems for Automata Networks:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kevin.
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.STACS.2021.32.  , 2021
Link: https://hal.archives-ouv..
 
?
13

Rice-Like Theorems for Automata Networks:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kevin.
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.STACS.2021.32.  , 2021
Link: https://hal.science/hal-..
 
?
14

Rice-Like Theorems for Automata Networks:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kevin.
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.STACS.2021.32.  , 2021
Link: https://hal.science/hal-..
 
?
15

Rice-Like Theorems for Automata Networks:

Gamard, Guilhem ; Guillon, Pierre ; Perrot, Kevin.
doi:10.4230/LIPIcs.STACS.2021.32.  , 2021
Link: https://doi.org/10.4230/..
 
1-15