Silvio Capobianco

Orcid: 0000-0002-2936-0419

According to our database1, Silvio Capobianco authored at least 21 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Additive Cellular Automata Graded-Monadically.
Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

2021
Besicovitch Pseudodistances with Respect to Non-Følner Sequences.
Complex Syst., 2021

2020
A Characterization of Amenable Groups by Besicovitch Pseudodistances.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2017
Post-surjectivity and balancedness of cellular automata over groups.
Discret. Math. Theor. Comput. Sci., 2017

2016
An "almost dual" to Gottschalk's Conjecture.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2013
Surjective cellular automata far from the Garden of Eden.
Discret. Math. Theor. Comput. Sci., 2013

2012
Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why?
Nat. Comput., 2012

2011
Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding block codes.
Theor. Comput. Sci., 2011

Can Anything from Noether's Theorem Be Salvaged for Discrete Dynamical Systems?
Proceedings of the Unconventional Computation - 10th International Conference, 2011

2010
Dissipative CA Computation Without Power Sources?
J. Cell. Autom., 2010

On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

A Categorical Outlook on Cellular Automata.
Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2009
Surjunctivity for Cellular Automata in Besicovitch Spaces.
J. Cell. Autom., 2009

On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems.
Inf. Comput., 2009

2008
When-and how-can a cellular automaton be rewritten as a lattice gas?
Theor. Comput. Sci., 2008

The equational theory of prebisimilarity over basic CCS with divergence.
Inf. Process. Lett., 2008

On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt.
Bull. EATCS, 2008

Multidimensional Cellular Automata and Generalization of Fekete's Lemma.
Discret. Math. Theor. Comput. Sci., 2008

Induced Subshifts and Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

2006
Cellular Automata over Semi-direct Product Groups: Reduction and Invertibility Results.
Int. J. Algebra Comput., 2006

2004
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme.
Theor. Comput. Sci., 2004


  Loading...