Zobrazeno 1 - 10
of 202
pro vyhledávání: '"Reis, Rogério"'
Publikováno v:
EPTCS 407, 2024, pp. 59-76
In this paper we consider block languages, namely sets of words having the same length, and study the deterministic and nondeterministic state complexity of several operations on these languages. Being a subclass of finite languages, the upper bounds
Externí odkaz:
http://arxiv.org/abs/2409.06970
In this paper we consider block languages, namely sets of words having the same length, and we propose a new representation for these languages. In particular, given an alphabet of size $k$ and a length $\ell$, these languages can be represented by b
Externí odkaz:
http://arxiv.org/abs/2404.11746
Publikováno v:
In Theoretical Computer Science 12 November 2024 1016
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length. However deciding code maximality boils down to deciding whether a given NFA is universal, an
Externí odkaz:
http://arxiv.org/abs/2202.01594
Autor:
Reis, Rogério Alves de Sousa
O controle da composição dos elementos presentes nos suplementos nutricionais é de grande importância devido ao crescente consumo e a comercialização de diversos tipos e marcas destes produtos. A determinação da quantidade de elementos nos su
Although regular expressions do not correspond univocally to regular languages, it is still worthwhile to study their properties and algorithms. For the average case analysis one often relies on the uniform random generation using a specific grammar
Externí odkaz:
http://arxiv.org/abs/2103.13175
We report here on the computational verification of a refinement of Zhi-Wei Sun's "1-3-5 conjecture" for all natural numbers up to 105 103 560 126. This, together with a result of two of the authors, completes the proof of that conjecture.
Externí odkaz:
http://arxiv.org/abs/2005.13526
Publikováno v:
In Information and Computation December 2023 295 Part A
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 Theoretical Computer Science 13 September 2023 972