Descriptive complexity for minimal time of cellular automata
E Grandjean, T Grente - … 34th Annual ACM/IEEE Symposium on …, 2019 - ieeexplore.ieee.org
Descriptive complexity may be useful to design programs in a natural declarative way. This
is important for parallel computation models such as cellular automata, because designing …
is important for parallel computation models such as cellular automata, because designing …
Inductive definitions in logic versus programs of real-time cellular automata
E Grandjean, T Grente, V Terrier - Theoretical Computer Science, 2024 - Elsevier
Descriptive complexity provides intrinsic, ie machine-independent, characterizations of the
main complexity classes. On the other hand, logic can be useful for designing programs in a …
main complexity classes. On the other hand, logic can be useful for designing programs in a …
Caractérisation et programmation en théorie des langages et en logique des classes de complexité efficace des automates cellulaires
T Grente - 2020 - theses.hal.science
Les automates cellulaires constituent le modèle de calcul parallèle et local par excellence.
Comme pour tout modèle du parallélisme, leur programmation est réputée difficile. La …
Comme pour tout modèle du parallélisme, leur programmation est réputée difficile. La …