13 citations · 101 across the 35 of their papers we have counts for
Showing 2017 · cs.FLShow all
2 papers · 2 filters
cs.FL2017★ 9 cited
Automaton Semigroups and Groups: On the Undecidability of Problems Related to Freeness and Finiteness
Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some con…
cs.FL2017★ 2 cited
A bound for the shortest reset words for semisimple synchronizing automata via the packing number
Emanuele Rodaro
We show that if a semisimple synchronizing automaton with states has a minimal reachable non-unary subset of cardinality , then there is a reset word of length at most…