Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Bacquey, Nicolas"'
Publikováno v:
ICALP 2017-44th International Colloquium on Automata, Languages and Programming
ICALP 2017-44th International Colloquium on Automata, Languages and Programming, Jul 2017, Warsaw, Poland. pp.1-14, ⟨10.4230/LIPIcs.ICALP.2017.99⟩
ICALP 2017-44th International Colloquium on Automata, Languages and Programming, Jul 2017, Warsaw, Poland. pp.1-14, ⟨10.4230/LIPIcs.ICALP.2017.99⟩
International audience; We establish an exact logical characterization of linear time complexity of cellular automata of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity class iff it is definable in existentia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::334f9d8dc631b06f115c8b753b112a62
https://hal.science/hal-01494246v2/file/0.pdf
https://hal.science/hal-01494246v2/file/0.pdf
Autor:
Bacquey, Nicolas
Publikováno v:
Informatique [cs]. Université de Caen Normandie, 2015. Français
This thesis analyses the computational capabilities of cellular automata working on periodical configurations of any dimension. We first study the maximal objects these cellular automata can identify; we call those objects primitive roots of periodic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1f698d73dfe61c7f40edf78196aafc5b
https://tel.archives-ouvertes.fr/tel-01261424
https://tel.archives-ouvertes.fr/tel-01261424
Autor:
Bacquey, Nicolas
Publikováno v:
Words 2015
Words 2015, Sep 2015, Kiel, Germany
Words 2015, Sep 2015, Kiel, Germany
International audience; This paper defines and studies the notion of primitive root of a bi-periodic infinite picture, that is a rectangular pattern that tiles the bi-periodic picture and contains exactly one representative of each equivalence class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1ed9313d792e61f6e03d484ef54174e9
https://hal.archives-ouvertes.fr/hal-01178256
https://hal.archives-ouvertes.fr/hal-01178256
Autor:
Bacquey, Nicolas
Publikováno v:
STACS 2014
STACS 2014, Mar 2014, Lyon, France. pp.1-12, ⟨10.4230/LIPIcs.STACS.2014.112⟩
STACS 2014, Mar 2014, Lyon, France. pp.1-12, ⟨10.4230/LIPIcs.STACS.2014.112⟩
International audience; This article deals with cellular automata (CA) working over periodic configurations, as opposed to standard CA, where the initial configuration is bounded by persistent symbols. We study the capabilities of language recognitio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::040b8c140f71c551f563dd6a94a1b596
https://hal.archives-ouvertes.fr/hal-00957130
https://hal.archives-ouvertes.fr/hal-00957130
Autor:
Bacquey, Nicolas
Publikováno v:
"Automata & JAC 2012"-Exploratory papers proceedings. Equipe MC3-Pôle MDSC-Septembre 2012.
Automata & JAC 2012
Automata & JAC 2012, Sep 2012, Cargese, France. pp.1-10
Automata & JAC 2012
Automata & JAC 2012, Sep 2012, Cargese, France. pp.1-10
International audience; This paper introduces a new algorithm to deal with the packing problem on cellular automata of di- mension 2 in linear time complexity; which means O(n) for an input square picture of size n × n. We use a divide and conquer a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3efa6eee5c1bf68823549be125df06e6
https://hal.archives-ouvertes.fr/hal-00957117/document
https://hal.archives-ouvertes.fr/hal-00957117/document