The following pages link to Bruno Durand (Q235572):
Displayed 50 items.
- Item:Q235572 (redirect page) (← links)
- Fixed-point tile sets and their applications (Q439933) (← links)
- Aperiodic tilings and entropy (Q511008) (← links)
- A Random NP-complete problem for inversion of 2D cellular automata (Q672376) (← links)
- On the complexity of deadlock detection in families of planar nets (Q1285587) (← links)
- Inversion of 2D cellular automata: Some complexity results (Q1341722) (← links)
- The surjectivity problem for 2D cellular automata (Q1342866) (← links)
- Do stronger definitions of randomness exist? (Q1401207) (← links)
- From logic to tiling (Q1603696) (← links)
- Local rules and global order, or aperiodic tilings (Q1777517) (← links)
- Number-conserving cellular automata I: Decidability. (Q1874409) (← links)
- Tilings: recursivity and regularity (Q1884987) (← links)
- Tilings and quasiperiodicity. (Q1960519) (← links)
- On the structure of Ammann A2 tilings (Q1985295) (← links)
- Admissibles in gaps (Q2011650) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- An algorithmic approach to characterizations of admissibles (Q2179361) (← links)
- Kolmogorov-Loveland stochasticity for finite strings (Q2390324) (← links)
- A new dimension sensitive property for cellular automata (Q2575746) (← links)
- Aperiodic Tilings and Entropy (Q2921981) (← links)
- Quasiperiodicity and Non-computability in Tilings (Q2946338) (← links)
- Complex tilings (Q3503757) (← links)
- (Q3508020) (← links)
- Fixed Point and Aperiodic Tilings (Q3533018) (← links)
- Tilings Robust to Errors (Q3557042) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- Asymptotic Cellular Complexity (Q3637225) (← links)
- High Complexity Tilings with Sparse Errors (Q3638051) (← links)
- (Q4218151) (← links)
- (Q4251047) (← links)
- (Q4260392) (← links)
- (Q4284241) (← links)
- (Q4375810) (← links)
- (Q4451022) (← links)
- (Q4451023) (← links)
- (Q4460870) (← links)
- (Q4501557) (← links)
- Tilings and quasiperiodicity (Q4571940) (← links)
- A random NP-complete problem for inversion of 2D cellular automata (Q4596613) (← links)
- (Q4779148) (← links)
- (Q4848813) (← links)
- (Q4910708) (← links)
- The expressiveness of quasiperiodic and minimal shifts of finite type (Q4964767) (← links)
- (Q5111219) (← links)
- Complex tilings (Q5176032) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311117) (← links)
- Automata, Languages and Programming (Q5466485) (← links)
- Kolmogorov complexity and cellular automata classification (Q5941280) (← links)
- Comparison between the complexity of a function and the complexity of its graph (Q5958280) (← links)
- Descriptive complexity of computable sequences (Q5958281) (← links)