Zobrazeno 1 - 10
of 1 039
pro vyhledávání: '"RIGO M."'
Publikováno v:
In Powder Technology 2 January 2024 432
Publikováno v:
International Journal of Algebra and Computation 32 (2022) 561-596
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is ultimately pe
Externí odkaz:
http://arxiv.org/abs/2007.08147
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Powder Technology 15 January 2023 414
Autor:
Nicosia L, Vitale C, Cuccia F, Figlia V, Giaj-Levra N, Mazzola R, Ricchetti F, Rigo M, Ruggieri R, Cavalleri S, Alongi F
Publikováno v:
Cancer Management and Research, Vol Volume 14, Pp 2839-2846 (2022)
Luca Nicosia,1 Claudio Vitale,1 Francesco Cuccia,1 Vanessa Figlia,1 Niccolò Giaj-Levra,1 Rosario Mazzola,1 Francesco Ricchetti,1 Michele Rigo,1 Ruggero Ruggieri,1 Stefano Cavalleri,2 Filippo Alongi1,3 1Advanced Radiation Oncology Department, IRCCS S
Externí odkaz:
https://doaj.org/article/a1929a75907c4ab0922050ccbbc596b5
Publikováno v:
In Powder Technology February 2022 399
Autor:
Nicosia, L., Franceschini, D., Perrone-Congedi, F., Casamassima, F., Gerardi, M.A., Rigo, M., Mazzola, R., Perna, M., Scotti, V., Fodor, A., Iurato, A., Pasqualetti, F., Gadducci, G., Chiesa, S., Niespolo, R.M., Bruni, A., Alicino, G., Frassinelli, L., Borghetti, P., Di Marzo, A., Ravasio, A., De Bari, B., Sepulcri, M., Aiello, D., Mortellaro, G., Sangalli, C., Franceschini, M., Montesi, G., Aquilanti, F.M., Lunardi, G., Valdagni, R., Fazio, I., Scarzello, Giovanni, Corti, L., Vavassori, V., Maranzano, E., Magrini, S.M., Arcangeli, S., Gambacorta, Maria Antonietta, Valentini, V., Paiar, F., Ramella, S., Di Muzio, N.G., Livi, L., Jereczek-Fossa, B.A., Osti, M.F., Scorsetti, M., Alongi, F.
Publikováno v:
In Radiotherapy and Oncology January 2022 166:92-99
Autor:
Rosas, Melany D., Piqueras, Cristian M. *, Piva, Gryele K., Ramírez-Rigo, M. Veronica, Filho, Lucio Cardozo, Bucalá, Verónica
Publikováno v:
In Journal of CO2 Utilization May 2021 47
Publikováno v:
Canadian Journal of Chemical Engineering; Aug2024, Vol. 102 Issue 8, p2650-2662, 13p
Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement of the usu
Externí odkaz:
http://arxiv.org/abs/1310.4743