#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2004

2019

- This year (3)
- Last 5 years (30)
- Last 10 years (54)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Abstract We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this… (More)

- Rogério Reis, Emanuele Rodaro
- WORDS
- 2013

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that there is a one-to-one correspondence between these decompositions and strongly connected… (More)

- Daniele D'Angeli, Emanuele Rodaro
- ArXiv
- 2015

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then… (More)

- Jorge Almeida, Emanuele Rodaro
- Int. J. Found. Comput. Sci.
- 2016

We present a ring theoretic approach to Cerný's conjecture via the Wedderburn-Artin theory. We first introduce the radical ideal of a synchronizing automaton, and then the natural notion of… (More)

We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem… (More)

- Emanuele Rodaro, Öznur Yeldan
- ArXiv
- 2013

Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be… (More)

- Emanuele Rodaro, Massimo Pasqualini, L. G. Iona, Paolo Di Benedetto
- Europa medicophysica
- 2004

AIM
Patients who have a fracture of the hip, usually are considered at a risk of fracturing the contralateral hip. This risk, not sufficiently addressed to in literature, becomes increasingly… (More)

- Elena V. Pribavkina, Emanuele Rodaro
- Inf. Comput.
- 2011

A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors is synchronizing. We characterize the class of synchronizing automata having only finitely many… (More)

Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete

- Elena V. Pribavkina, Emanuele Rodaro
- CiE
- 2011

A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing word, i.e. a word that takes all the states of the automaton A to a particular one. We consider… (More)

- C. Nuccio, Emanuele Rodaro
- SOFSEM
- 2008

A given set F of n × n matrices is said to be mortal if the n × n null matrix belongs to the free semigroup generated by F. It is known that the mortality problem for 3×3 matrices with integer… (More)