activity
20112026
most citedOn the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups

13 citations · 101 across the 35 of their papers we have counts for

collaborators

38 papers

math.GR2026

A graph-theoretical characterisation of subgroups of Thompson's group

Corentin Bodart, Daniele D'Angeli, Davide Perego +1

We prove a graph-theoretical characterisation of finitely generated subgroups of Thompson's group : a finitely generated group embeds in if and only if it admits a faithful…

math.CO2026

On totally synchronizing graphs

Daniele D'Angeli, Emanuele Rodaro

A coloring of a finite -out directed graph is viewed as a deterministic complete automaton with state set . The graph is called \emph{totally synchronizing} if eve…

math.CO2026

Topological indices on self-similar graphs generated by groups

Daniele D'Angeli, Stefan Hammer, Emanuele Rodaro

In this paper, we determine precise formulas for the diameters, the number of perfect matchings, and the Tutte polynomials for an infinite family of finite graphs, namely the Schre…

cs.FL2025

The hereditariness problem for the Černý conjecture

Emanuele Rodaro, Riccardo Venturi

This paper addresses the lifting problem for the Černý conjecture: namely, whether the validity of the conjecture for a quotient automaton can always be transferred (or "lifted") t…

math.CO2025

Horofunctions of infinite Sierpinski polygon graphs

Daniele D'Angeli, Francesco Matucci, Davide Perego +1

Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over letters with and , a sequence of pointed finite gra…

math.GR2025

Freeness Obstructions for Self-Similar Groups Acting on Rooted Trees

Daniele D'Angeli, Emanuele Rodaro

We prove two general obstructions to freeness for self-similar groups and derive consequences for automaton groups. First, let be a finite invertible Mealy automaton w…