RODARO, EMANUELE
 Distribuzione geografica
Continente #
NA - Nord America 122
EU - Europa 112
AS - Asia 35
AF - Africa 5
SA - Sud America 2
Totale 276
Nazione #
US - Stati Uniti d'America 118
IT - Italia 89
CN - Cina 13
VN - Vietnam 12
IN - India 8
PL - Polonia 6
ZA - Sudafrica 5
DE - Germania 4
FR - Francia 3
NL - Olanda 3
RU - Federazione Russa 3
CR - Costa Rica 2
GB - Regno Unito 2
PR - Porto Rico 2
TW - Taiwan 2
BR - Brasile 1
CL - Cile 1
FI - Finlandia 1
UA - Ucraina 1
Totale 276
Città #
Milan 27
Buffalo 14
Dong Ket 10
Ashburn 8
Guwahati 8
Seattle 8
Woodbridge 8
Fairfield 7
Houston 7
Ann Arbor 6
Latina 6
Polska 6
Amalfi 5
Beijing 5
Cambridge 5
Muizenberg 5
Santa Cruz 4
Groningen 3
Las Vegas 3
Moscow 3
Mountain View 3
Paris 3
Wilmington 3
Los Angeles 2
Norwalk 2
San Juan 2
Taipei 2
Udine 2
Auburn 1
Borehamwood 1
Cernusco Sul Naviglio 1
Changchun 1
Chicago 1
Council Bluffs 1
Dearborn 1
Downers Grove 1
Fleming Island 1
Fuzhou 1
Hangzhou 1
Imperia 1
Jinan 1
Leighton Buzzard 1
Lombard 1
Mannheim 1
Michelfeld 1
Milpitas 1
Nerviano 1
New York 1
Padova 1
Pasadena 1
Phoenix 1
Portland 1
Provo 1
Rome 1
Rovellasca 1
San Francisco 1
Scottsdale 1
Scranton 1
Seriate 1
Shenyang 1
Terni 1
University Park 1
Wuhan 1
Totale 202
Nome #
Ideal regular languages and strongly connected synchronizing automata, file e0c31c0a-37f0-4599-e053-1705fe0aef77 139
Missing factors of ideals and synchronizing automata, file e0c31c0f-fd6f-4599-e053-1705fe0aef77 29
Maximal subgroups of amalgams of finite inverse semigroups, file e0c31c0e-5d4a-4599-e053-1705fe0aef77 19
Fragile words and Cayley type transducers, file e0c31c0e-0473-4599-e053-1705fe0aef77 15
Catalan fragile words, file e0c31c0f-b0b2-4599-e053-1705fe0aef77 11
AUTOMATON SEMIGROUPS AND GROUPS: ON THE UNDECIDABILITY OF PROBLEMS RELATED TO FREENESS AND FINITENESS (vol 237, pg 15, 2020), file 2b8cfc67-079b-4f4f-b2c5-6bd4dcaa5268 7
A geometric approach to (semi)-groups defined by automata via dual transducers, file e0c31c11-4bc4-4599-e053-1705fe0aef77 7
On the complexity of the word problem for automaton semigroups and automaton groups, file e0c31c11-1ab8-4599-e053-1705fe0aef77 6
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, file e0c31c0e-e18e-4599-e053-1705fe0aef77 5
On the complexity of the word problem for automaton semigroups and automaton groups, file e0c31c0b-9c0a-4599-e053-1705fe0aef77 4
Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness, file e0c31c0f-c90e-4599-e053-1705fe0aef77 4
A geometric approach to (semi)-groups defined by automata via dual transducers, file e0c31c10-0379-4599-e053-1705fe0aef77 4
Maximal subgroups of amalgams of finite inverse semigroups, file e0c31c09-01d2-4599-e053-1705fe0aef77 3
Eraser morphisms and membership problem in groups and monoids, file e0c31c0f-b0ac-4599-e053-1705fe0aef77 3
Orbit expandability of automaton semigroups and groups, file e0c31c0f-e87c-4599-e053-1705fe0aef77 3
The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton, file e0c31c0f-f29a-4599-e053-1705fe0aef77 3
On the structure theory of partial automaton semigroups, file e0c31c0f-fd7c-4599-e053-1705fe0aef77 3
The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton, file e0c31c10-f086-4599-e053-1705fe0aef77 3
Eraser morphisms and membership problem in groups and monoids, file d79e7481-9c9a-498e-8953-86093d06a2fb 2
Strongly connected synchronizing automata and the language of minimal reset words, file e0c31c0f-f28c-4599-e053-1705fe0aef77 2
Freeness of automaton groups vs boundary dynamics, file e0c31c0f-f295-4599-e053-1705fe0aef77 2
Groups and semigroups defined by colorings of synchronizing automata, file e0c31c0f-fd72-4599-e053-1705fe0aef77 2
On the structure theory of partial automaton semigroups, file 821c941c-dc67-4c83-807d-add25a3ff2ec 1
Orbit expandability of automaton semigroups and groups, file e00b9471-e8cd-4ec0-b128-90ef5d29b623 1
Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups, file e0c31c09-4008-4599-e053-1705fe0aef77 1
SEMISIMPLE SYNCHRONIZING AUTOMATA AND THE WEDDERBURN-ARTIN THEORY, file e0c31c0b-9869-4599-e053-1705fe0aef77 1
Equalizers and kernels in categories of monoids, file e0c31c0b-b31d-4599-e053-1705fe0aef77 1
State complexity of code operators, file e0c31c0f-b0b0-4599-e053-1705fe0aef77 1
Synchronizing automata with finitely many minimal synchronizing words, file e0c31c0f-b945-4599-e053-1705fe0aef77 1
Bicyclic subsemigroups in amalgams of finite inverse semigroups, file e0c31c0f-c07a-4599-e053-1705fe0aef77 1
Amalgams of inverse semigroups and reversible two-counter machines, file e0c31c0f-fd76-4599-e053-1705fe0aef77 1
On periodic points of free inverse monoid homomorphisms, file e0c31c10-037b-4599-e053-1705fe0aef77 1
Fixed points of endomorphisms of graph groups, file e0c31c10-037d-4599-e053-1705fe0aef77 1
Circular automata synchronize with high probability, file e0c31c10-971f-4599-e053-1705fe0aef77 1
Totale 288
Categoria #
all - tutte 509
article - articoli 508
book - libri 0
conference - conferenze 1
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 1018


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/20182 0000 00 00 0200
2018/201927 1021 01 01 34104
2019/202038 6243 63 32 3312
2020/2021113 2741116 182 23 231411
2021/202256 7644 22 44 8294
2022/202342 14104 115 70 0000
Totale 288