#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tullio Ceccherini-Silberstein, Michel Coornaert
- Encyclopedia of Complexity and Systems Science
- 2009

A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of subwords F yields a sublanguage LF whose exponential growth rate is smaller than that of L. It is shown that every ergodic unambiguous, nonlinear context-free language is growth-sensitive. “Ergodic” means for a context-free grammar and language that its dependency… (More)

- Tullio Ceccherini-Silberstein, Rostislav I. Grigorchuk, Pierre de la Harpe, LA HARPE
- 1997

This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski, according to which a pseudogroup without invariant mean gives rise to paradoxical decompositions, and to defining a… (More)

- Frances C. Kirwan, Peter Sarnak, +4 authors Filippo Tolli
- 2010

The representation theory of the symmetric groups is a classical topic that, since the pioneering work of Frobenius, Schur and Young, has grown into a huge body of theory, with many important connections to other areas of mathematics and physics. This self-contained book provides a detailed introduction to the subject, covering classical topics such as the… (More)

- Tullio Ceccherini-Silberstein, Michel Coornaert
- Theor. Comput. Sci.
- 2008

- Tullio Ceccherini-Silberstein, Wolfgang Woess
- Eur. J. Comb.
- 2012

Let G be a finitely generated group, A a finite set of generators and K a subgroup of G. We call the pair (G, K) context-free if the set of all words over A that reduce in G to an element of K is a context-free language. When K is trivial, G itself is called context-free; context-free groups have been classified more than 20 years ago in celebrated work of… (More)

- Ievgen Bondarenko, Tullio Ceccherini-Silberstein, Alfredo Donno, Volodymyr Nekrashevych
- Eur. J. Comb.
- 2012

For every infinite sequence ω = x1x2 . . ., with xi ∈ {0, 1}, we construct an infinite 4-regular graph Xω. These graphs are precisely the Schreier graphs of the action of a certain self-similar group on the space {0, 1}∞. We solve the isomorphism and local isomorphism problems for these graphs, and determine their automorphism groups. Finally, we prove that… (More)

- Tullio Ceccherini-Silberstein, Wolfgang Woess
- Theor. Comput. Sci.
- 2003

A language L over a )nite alphabet is called growth-sensitive if forbidding any set of subwords F yields a sub-language L whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic non-linear context-free language of convergent type is growth-sensitive. “Ergodic” means that the dependency di-graph of the generating… (More)

Extending the analogous result of Cannon andWagreich for the fundamental groups of surfaces, we show that, for the l-regular graphs Xl,m associated to regular tessellations of the hyperbolic plane by m-gons, the denominators of the growth series (which are rational and were computed by Floyd and Plotnick (Floyd and Plotnick, 1994)) are reciprocal Salem… (More)

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.