Daniele D'Angeli

Orcid: 0000-0002-8068-0362

According to our database1, Daniele D'Angeli authored at least 26 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Freeness Problem for Automaton Semigroups.
CoRR, 2024

2022
Characterizations of line graphs in signed and gain graphs.
Eur. J. Comb., 2022

Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs.
Discret. Appl. Math., 2022

2021
Circular automata synchronize with high probability.
J. Comb. Theory, Ser. A, 2021

2020
Orbit expandability of automaton semigroups and groups.
Theor. Comput. Sci., 2020

Boundary dynamics for bireversible and for contracting automaton groups.
Int. J. Algebra Comput., 2020

2019
Orbits of Automaton Semigroups and Groups.
CoRR, 2019

Permutational Powers of a Graph.
Electron. J. Comb., 2019

2018
On the Structure Theory of Partial Automaton Semigroups.
CoRR, 2018

2017
Shuffling matrices, Kronecker product and Discrete Fourier Transform.
Discret. Appl. Math., 2017

Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness.
CoRR, 2017

On the complexity of the word problem for automaton semigroups and automaton groups.
Adv. Appl. Math., 2017

2016
Connectedness and Isomorphism Properties of the Zig-Zag Product of Graphs.
J. Graph Theory, 2016

Metric compactification of infinite Sierpiński carpet graphs.
Discret. Math., 2016

Boundary action of automaton groups without singular points and Wang tilings.
CoRR, 2016

2015
The lamplighter group ℤ<sub>3</sub> wr ℤ generated by a bireversible automaton.
CoRR, 2015

2014
Groups and semigroups defined by colorings of synchronizing automata.
Int. J. Algebra Comput., 2014

On the freeness of automata groups.
CoRR, 2014

A geometric approach to (semi)-groups defined by automata via dual transducers.
CoRR, 2014

Schreier Graphs of an Extended Version of the Binary Adding Machine.
Electron. J. Comb., 2014

2013
The lumpability property for a family of Markov chains on poset block structures.
Adv. Appl. Math., 2013

2012
Counting dimer coverings on self-similar Schreier graphs.
Eur. J. Comb., 2012

Appendix: Gelfand pairs associated with the action of G.
Eur. J. Comb., 2012

2011
Generalized crested products of Markov chains.
Eur. J. Comb., 2011

Weighted Spanning Trees on some Self-Similar Graphs.
Electron. J. Comb., 2011

2010
Markov chains on orthogonal block structures.
Eur. J. Comb., 2010


  Loading...