| Slopes of Multidimensional Subshifts | 0 | 0.34 | 2020 |
| A Recipe for Quantum Graphical Languages. | 0 | 0.34 | 2020 |
| COMPLETENESS OF THE ZX-CALCULUS | 0 | 0.34 | 2019 |
| A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness | 0 | 0.34 | 2019 |
| Completeness of Graphical Languages for Mixed State Quantum Mechanics | 0 | 0.34 | 2019 |
| A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. | 9 | 0.55 | 2018 |
| Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. | 6 | 0.47 | 2018 |
| The rational fragment of the ZX-calculus. | 0 | 0.34 | 2018 |
| Y-Calculus: A language for real Matrices derived from the ZX-Calculus. | 0 | 0.34 | 2017 |
| Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive. | 0 | 0.34 | 2017 |
| ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. | 4 | 0.42 | 2017 |
| Translation-like Actions and Aperiodic Subshifts on Groups | 0 | 0.34 | 2015 |
| Aperiodic Subshifts on Polycyclic Groups. | 1 | 0.38 | 2015 |
| An aperiodic set of 11 Wang tiles. | 3 | 0.62 | 2015 |
| Enumeration in Closure Spaces with Applications to Algebra | 0 | 0.34 | 2015 |
| Hardness of conjugacy, embedding and factorization of multidimensional subshifts | 0 | 0.34 | 2015 |
| Computability of the entropy of one-tape Turing Machines | 3 | 0.52 | 2013 |
| Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. | 2 | 0.43 | 2013 |
| Characterizations of periods of multidimensional shifts | 0 | 0.34 | 2013 |
| Subshifts as models for MSO logic | 1 | 0.37 | 2013 |
| Structuring multi-dimensional subshifts. | 1 | 0.48 | 2013 |
| On immortal configurations in turing machines | 2 | 0.46 | 2012 |
| Fixed Parameter Undecidability For Wang Tilesets | 1 | 0.38 | 2012 |
| Hardness of conjugacy and factorization of multidimensional subshifts of finite type | 0 | 0.34 | 2012 |
| Pi01 sets and tilings | 2 | 0.44 | 2011 |
| P01\it \Pi^0_1 Sets and Tilings. | 0 | 0.34 | 2011 |
| Turing degrees of multidimensional SFTs | 0 | 0.34 | 2011 |
| Tilings robust to errors | 0 | 0.34 | 2010 |
| Computing (or not) Quasi-Periodicity Functions of Tilings | 3 | 0.64 | 2010 |
| The periodic domino problem revisited | 1 | 0.36 | 2010 |
| Slopes of Tilings | 0 | 0.34 | 2010 |
| Periodicity in tilings | 2 | 0.47 | 2010 |
| Subshifts and Logic: Back and Forth | 0 | 0.34 | 2009 |
| Subshifts, Languages and Logic | 5 | 0.45 | 2009 |
| Playing with Conway's problem | 0 | 0.34 | 2008 |
| Tilings and model theory | 6 | 0.57 | 2008 |
| Structural aspects of tilings | 10 | 1.09 | 2008 |
| Finding a vector orthogonal to roughly half a collection of vectors | 4 | 0.45 | 2008 |
| Quantum automata and algebraic groups | 10 | 1.02 | 2005 |
| Decidable and Undecidable Problems about Quantum Automata | 33 | 1.51 | 2005 |
| Universality in Quantum Computation | 1 | 0.39 | 2004 |
| Topological Automata | 7 | 0.53 | 1974 |
| Topological Automata | 6 | 0.64 | 1974 |
