Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Petri Salmela"'
Publikováno v:
BMC Pulmonary Medicine, Vol 24, Iss 1, Pp 1-8 (2024)
Abstract Background Asthma and chronic obstructive pulmonary disease (COPD) are common diseases mostly treated in primary care. However, the usage patterns of drugs for obstructive airway diseases (R03 drugs) at the national level are not known. Obje
Externí odkaz:
https://doaj.org/article/4f93408c586d430a8982634ff0ffdf02
Publikováno v:
European Clinical Respiratory Journal, Vol 10, Iss 1 (2023)
ABSTRACTBackground Childhood-onset allergic asthma is the best-known phenotype of asthma. Adult-onset asthma, also an important entity, is instead often shown to be more non-allergic. There is still a lack of studies concerning the association of all
Externí odkaz:
https://doaj.org/article/d83c7285858f434fb830a4174aebe76f
Publikováno v:
European Clinical Respiratory Journal, Vol 10, Iss 1 (2023)
ABSTRACTBackground Asthma program in Finland decreased asthma-related mortality and expenses of care on national level, but there is lack of data on adherence to treatment guidelines and disease control on individual level. We aimed to assess adheren
Externí odkaz:
https://doaj.org/article/08997981a680421790427bf0bad104db
Publikováno v:
European clinical respiratory journal. 10(1)
Background: Asthma program in Finland decreased asthma-related mortality and expenses of care on national level, but there is lack of data on adherence to treatment guidelines and disease control on individual level. We aimed to assess adherence to g
Publikováno v:
Theoretical Computer Science. 410(24-25):2345-2351
Two languages X and Y are called conjugates, if they satisfy the conjugacy equation XZ=ZY for some non-empty language Z. We will compare solutions of this equation with those of the corresponding equation of words and study the case of finite biprefi
Autor:
Paolo Massazza, Petri Salmela
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 40:295-301
Given a finite alphabet Σ and a language L ⊆ ∑+ , the centralizer of L is defined as the maximal language commuting with it. We prove that if the primitive root of the smallest word of L (with respect to a lexicographic order) is prefix distingu
Publikováno v:
Aspects of Molecular Computing ISBN: 9783540207818
Aspects of Molecular Computing
Aspects of Molecular Computing
We show that the maximal set commuting with a given regular set – its centralizer – can be defined as the maximal fixed point of a certain language operator. Unfortunately, however, an infinite number of iterations might be needed even in the cas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e6e28309afca2e3340578906195c618
https://doi.org/10.1007/978-3-540-24635-0_8
https://doi.org/10.1007/978-3-540-24635-0_8
Publikováno v:
7th European Conference on Speech Communication and Technology (Eurospeech 2001).
Publikováno v:
6th European Conference on Speech Communication and Technology (Eurospeech 1999).
Publikováno v:
6th European Conference on Speech Communication and Technology (Eurospeech 1999).