activity
20082026
most citedOn the density of periodic configurations in strongly irreducible subshifts

33 citations · 162 across the 31 of their papers we have counts for

collaborators
Showing math.GRShow all

9 papers · 1 filter

math.GR2024

Strongly sofic monoids, sofic topological entropy, and surjunctivity

Tullio Ceccherini-Silberstein, Michel Coornaert, Xuan Kien Phung

We introduce the class of strongly sofic monoids. This class of monoids strictly contains the class of sofic groups and is a proper subclass of the class of sofic monoids. We defin…

math.GR2023★ 1 cited

First-order model theory and Kaplansky's stable finiteness conjecture

Tullio Ceccherini-Silberstein, Michel Coornaert, Xuan Kien Phung

Using algebraic geometry methods, the third author proved that the group ring of a surjunctive group with coefficients in a field is always stably finite. In other words, every gro…

math.GR2014

On Residually Finite Semigroups of Cellullar Automata

Tullio Ceccherini-Silberstein, Michel Coornaert

We prove that if is a monoid and a finite set with more than one element, then the residual finiteness of is equivalent to that of the monoid consisting of all cellular…

math.GR2014

Multipass automata and group word problems

Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +2

We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted…

math.GR2012★ 5 cited

An analogue of Fekete's lemma for subadditive functions on cancellative amenable semigroups

Tullio Ceccherini-Silberstein, Fabrice Krieger, Michel Coornaert

We prove an analogue of Fekete's lemma for subadditive right-subinvariant functions defined on the finite subsets of a cancellative left-amenable semigroup. This extends results pr…

math.GR2012★ 9 cited

Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic

Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +1

In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, an…

math.GR2009★ 16 cited

On the reversibility and the closed image property of linear cellular automata

Tullio Ceccherini-Silberstein, Michel Coornaert

When is an arbitrary group and is a finite-dimensional vector space, it is known that every bijective linear cellular automaton is reversible and that…

math.GR2009

On a characterization of locally finite groups in terms of linear cellular automata

Tullio Ceccherini-Silberstein, Michel Coornaert

We prove that a group is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over is injective.

math.GR2008★ 9 cited

Expansive actions on uniform spaces and surjunctive maps

Tullio Ceccherini-Silberstein, Michel Coornaert

We present a uniform version of a result of M. Gromov on the surjunctivity of maps commuting with expansive group actions and discuss several applications. We prove in particular t…