Catalogo dei prodotti della ricerca

D'ALESSANDRO, Flavio
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.142
EU - Europa 375
AS - Asia 231
SA - Sud America 6
AF - Africa 1
OC - Oceania 1
Totale 2.756
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.130
IT - Italia 97
UA - Ucraina 90
IN - India 88
SG - Singapore 79
SE - Svezia 54
FI - Finlandia 45
TR - Turchia 32
DE - Germania 31
GB - Regno Unito 23
CN - Cina 15
CA - Canada 12
ID - Indonesia 12
RO - Romania 11
IE - Irlanda 9
BE - Belgio 7
AR - Argentina 5
FR - Francia 3
VN - Vietnam 3
KR - Corea 2
NL - Olanda 2
PL - Polonia 2
AU - Australia 1
BG - Bulgaria 1
BR - Brasile 1
SC - Seychelles 1
Totale 2.756
Salva come PNG Salva come JPEG
Città #
Fairfield 364
Woodbridge 217
Houston 202
Seattle 181
Ashburn 174
Ann Arbor 157
Wilmington 139
Cambridge 118
Chandler 85
Princeton 57
Singapore 48
Plano 46
Lawrence 41
Jacksonville 36
Rome 36
San Paolo di Civitate 36
Boston 29
Des Moines 24
Millbury 23
San Diego 19
Norwalk 16
Andover 15
Jakarta 12
Toronto 11
Dublin 9
Indiana 8
Brussels 7
Falls Church 7
Boardman 6
Cagliari 6
Southend 6
Federal 5
Kocaeli 5
Padova 5
San Mateo 5
Istanbul 4
Mannheim 4
Başak 3
Bogazici 3
Bühl 3
Karlsruhe 3
Laurel 3
Santa Clara 3
Beijing 2
Grafing 2
Hefei 2
Helsinki 2
Ho Chi Minh City 2
Konya 2
Kunming 2
London 2
Milan 2
New York 2
Novoli 2
Perugia 2
San Francisco 2
Ankara 1
Arnsberg 1
Auburn Hills 1
Bremen 1
Buffalo 1
Büdelsdorf 1
Casper 1
Chengdu 1
Chiswick 1
Clichy 1
Darmstadt 1
Dearborn 1
Falkenstein 1
Grünwald 1
Hanoi 1
Harbin 1
Jinan 1
Kilburn 1
Los Angeles 1
Ludwigshafen 1
Mirandola 1
Montréal 1
Nanjing 1
New Bedfont 1
Nuremberg 1
Phoenix 1
Prescot 1
Redmond 1
Santiago 1
Shanghai 1
Shenyang 1
Sofia 1
Spello 1
Werl 1
Wuhan 1
Totale 2.242
Salva come PNG Salva come JPEG
Nome #
Homing Vector Automata 102
The synchronization problem for strongly transitive automata 102
On well Quasi-orders on languages 92
Well quasi orders and the shuffle closure of finite sets 86
Language classes associated with automata over matrix groups 84
The synchronization problem for locally strongly transitive automata 77
A Combinatorial Property for Semigroups of Matrices 76
On the commutative equivalence of bounded context-free and regular languages: the semi-linear case 75
On incomplete and synchronizing finite sets 73
Well quasi-orders and context-free grammars 70
On finite-index indexed grammars and their restrictions 70
On the structure of the counting function of sparse context-free languages 67
A combinatorial problem on Trapezoidal words 67
A note on the multiplicative group of a division ring 66
Teoria degli Automi Finiti 62
On the Commutative Equivalence of Context-Free Languages 62
Commutativity in free inverse monoids 61
Well quasi-orders generated by a word-shuffle rewriting 60
On the Hybrid Cerny-Road Coloring Problem and Hamiltonian Paths 59
On Bounded Rational Trace Languages 59
Quantum finite automata and linear context-free languages: a decidable problem 57
Independent sets of words and the synchronization problem 56
Language classes associated with automata over matrix groups 55
Strongly transitive automata and the Cerny conjecture 55
On the decidability of the intersection problem for quantum automata and context-free languages 55
The finite power property for rational sets of the free group 54
Generalized results on monoids as memory 54
A non commutativity statement for algebraic quaternions 53
The finite power property in free groups 53
On the commutative equivalence of bounded context-free and regular languages: the code case 52
REGULARITY OF LANGUAGES DEFINED BY FORMAL SERIES WITH ISOLATED CUT POINT 51
On Bounded Linear Codes and the Commutative Equivalence 51
Quasi-polynomials, linear Diophantine equations and semi-linear sets 50
Avoidable sets and well quasi orders 48
Coding by minimal linear grammars 48
Avoidable sets, well quasi-orders and derivation systems 46
Free groups of quaternions 45
On the Commutative Equivalence of Bounded Semi-linear Codes 45
On the Commutative Equivalence of Algebraic Formal Series and Languages 43
On Finite-Index Indexed Grammars and Their Restrictions 38
On the growth function of context-free languages 36
Automates, groupes libres et commutations 36
The Parikh functions of sparse context-free languages are quasi-polynomials 34
On the complexity of Simon automata over the Dyck language 33
Well quasi-orders and formal languages 32
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Equivalence 32
La congettura della equivalenza commutativa nella teoria dei codici 29
On the separability of sparse context-free languages 29
Sulla struttura combinatoria dei linguaggi bounded 26
On the commutative equivalence of semi-linear sets of N^k 26
Cerny-like problems for finite sets of words 22
Unboundedness Problems for Machines with Reversal-Bounded Counters 20
null 20
Locally strongly transitive automata in the Cerny conjecture and related problems 20
The commutative equivalence of bounded context-free and regular languages 14
Quantum Automata and Languages of Finite Index 7
Totale 2.895
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.025
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 8.025
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020559 0 0 0 31 74 82 83 107 88 48 31 15
2020/2021285 35 32 15 14 2 40 17 36 33 31 13 17
2021/2022542 9 38 63 19 73 24 18 59 31 42 60 106
2022/2023402 100 84 22 32 45 49 3 15 28 9 11 4
2023/2024164 18 22 12 15 5 3 2 17 4 20 12 34
2024/202569 24 2 24 19 0 0 0 0 0 0 0 0
Totale 2.895