#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2003

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Francesca Fiorenzi
- Theor. Comput. Sci.
- 2003

We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.

- Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu
- Discrete Applied Mathematics
- 2011

A vertex colouring of a graph G is nonrepetitive if for any path P = (v1, v2, . . . , v2r) in G, the first half is coloured differently from the second half. The Thue choice number of G is the least integer l such that for every l-list assignment L of G, there exists a nonrepetitive L-colouring of G. We prove that for any positive integer l, there is a tree… (More)

We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.

- Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
- Theor. Comput. Sci.
- 2005

We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts. We prove that these classes define invariants shift equivalence… (More)

- Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
- STACS
- 2004

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.

- Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic
- Theor. Comput. Sci.
- 2013

We study the sofic tree shifts of A ∗ , where Σ∗ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X ⊂ A ∗ is a sofic tree shift, then the configurations in X whose orbit under the shift action is finite are dense in X , and, as a consequence of this, we deduce… (More)

- Gabriele Fici, Francesca Fiorenzi
- AUTOMATA & JAC
- 2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k ≥ 2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

- Arnaud Dartois, Francesca Fiorenzi, Paolo Francini
- Eur. J. Comb.
- 2003