( en | de | ru )

 

Disambiguation of "de Menibus, Benjamin Hellouin"

Author of the publication

copydeleteadd this publication to your clipboard
The Domino Problem Is Undecidable on Every Rhombus Subshift.

, , and . DLT, volume 13911 of Lecture Notes in Computer Science, page 100-112. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amal Dé

Dennis De

Soumen De

Inessa De

Suparna De

 

Other publications of authors with the same name

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 483-494. Springer, (2011)Two-player Domino games., and . CoRR, (2023)Construction of mu-Limit Sets of Two-dimensional Cellular Automata., and . STACS, volume 30 of LIPIcs, page 262-274. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Self-organization in Cellular Automata: A Particle-Based Approach., and . Developments in Language Theory, volume 6795 of Lecture Notes in Computer Science, page 251-263. Springer, (2011)Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton., and . WORDS, volume 13899 of Lecture Notes in Computer Science, page 104-116. Springer, (2023)String attractors and bi-infinite words., , and . CoRR, (2024)The Domino Problem Is Undecidable on Every Rhombus Subshift., , and . DLT, volume 13911 of Lecture Notes in Computer Science, page 100-112. Springer, (2023)The Aperiodic Domino Problem in Higher Dimension., and . STACS, volume 219 of LIPIcs, page 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Two-Player Domino Games., and . CiE, volume 14773 of Lecture Notes in Computer Science, page 139-152. Springer, (2024)