Catalogo dei prodotti della ricerca

D'ALESSANDRO, Flavio
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.307
EU - Europa 384
AS - Asia 259
SA - Sud America 6
AF - Africa 1
OC - Oceania 1
Totale 2.958
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.295
IT - Italia 100
SG - Singapore 99
UA - Ucraina 90
IN - India 88
SE - Svezia 54
FI - Finlandia 45
DE - Germania 32
TR - Turchia 32
GB - Regno Unito 27
CN - Cina 21
CA - Canada 12
ID - Indonesia 12
RO - Romania 11
IE - Irlanda 9
BE - Belgio 7
AR - Argentina 5
KR - Corea 4
FR - Francia 3
VN - Vietnam 3
NL - Olanda 2
PL - Polonia 2
AT - Austria 1
AU - Australia 1
BG - Bulgaria 1
BR - Brasile 1
SC - Seychelles 1
Totale 2.958
Salva come PNG Salva come JPEG
Città #
Fairfield 364
Woodbridge 217
Houston 202
Seattle 181
Ashburn 174
Santa Clara 168
Ann Arbor 157
Wilmington 139
Cambridge 118
Chandler 85
Singapore 67
Princeton 57
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
Liverpool 4
Mannheim 4
Başak 3
Bogazici 3
Bühl 3
Karlsruhe 3
Laurel 3
Beijing 2
Falkenstein 2
Grafing 2
Gyeongsan-si 2
Hefei 2
Helsinki 2
Ho Chi Minh City 2
Konya 2
Kunming 2
London 2
Milan 2
Naples 2
New York 2
Novoli 2
Perugia 2
San Francisco 2
Shanghai 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
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
Quanzhou 1
Redmond 1
Santiago 1
Shenyang 1
Sofia 1
Spello 1
Werl 1
Wuhan 1
Totale 2.437
Salva come PNG Salva come JPEG
Nome #
Homing Vector Automata 106
The synchronization problem for strongly transitive automata 105
On well Quasi-orders on languages 96
Well quasi orders and the shuffle closure of finite sets 89
Language classes associated with automata over matrix groups 88
On the commutative equivalence of bounded context-free and regular languages: the semi-linear case 81
The synchronization problem for locally strongly transitive automata 80
A Combinatorial Property for Semigroups of Matrices 80
On incomplete and synchronizing finite sets 76
Well quasi-orders and context-free grammars 73
On finite-index indexed grammars and their restrictions 73
A combinatorial problem on Trapezoidal words 71
On the structure of the counting function of sparse context-free languages 70
A note on the multiplicative group of a division ring 70
Teoria degli Automi Finiti 67
On the Commutative Equivalence of Context-Free Languages 66
Commutativity in free inverse monoids 65
On Bounded Rational Trace Languages 64
Well quasi-orders generated by a word-shuffle rewriting 63
On the Hybrid Cerny-Road Coloring Problem and Hamiltonian Paths 62
Independent sets of words and the synchronization problem 60
Quantum finite automata and linear context-free languages: a decidable problem 60
On Bounded Linear Codes and the Commutative Equivalence 60
Language classes associated with automata over matrix groups 58
Generalized results on monoids as memory 58
Strongly transitive automata and the Cerny conjecture 58
On the decidability of the intersection problem for quantum automata and context-free languages 58
The finite power property for rational sets of the free group 57
A non commutativity statement for algebraic quaternions 57
The finite power property in free groups 56
On the commutative equivalence of bounded context-free and regular languages: the code case 55
REGULARITY OF LANGUAGES DEFINED BY FORMAL SERIES WITH ISOLATED CUT POINT 54
Free groups of quaternions 53
Quasi-polynomials, linear Diophantine equations and semi-linear sets 53
Avoidable sets and well quasi orders 52
Coding by minimal linear grammars 51
Avoidable sets, well quasi-orders and derivation systems 50
On the Commutative Equivalence of Bounded Semi-linear Codes 48
On the Commutative Equivalence of Algebraic Formal Series and Languages 46
On Finite-Index Indexed Grammars and Their Restrictions 41
Automates, groupes libres et commutations 40
On the growth function of context-free languages 38
The Parikh functions of sparse context-free languages are quasi-polynomials 37
On the complexity of Simon automata over the Dyck language 36
Well quasi-orders and formal languages 35
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Equivalence 35
La congettura della equivalenza commutativa nella teoria dei codici 33
On the separability of sparse context-free languages 32
Sulla struttura combinatoria dei linguaggi bounded 30
On the commutative equivalence of semi-linear sets of N^k 29
Cerny-like problems for finite sets of words 26
Locally strongly transitive automata in the Cerny conjecture and related problems 24
Unboundedness Problems for Machines with Reversal-Bounded Counters 23
null 20
The commutative equivalence of bounded context-free and regular languages 17
Quantum Automata and Languages of Finite Index 12
Totale 3.097
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.603
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.603
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020454 0 0 0 0 0 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/2025271 24 2 24 28 139 54 0 0 0 0 0 0
Totale 3.097