23 citations · 51 across the 17 of their papers we have counts for
20 papers
Operational State Complexity of Block Languages
Guilherme Duarte, Nelma Moreira, Luca Prigioniero +1
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 t…
On the Representation and State Complexity of Block Languages
Guilherme Duarte, Nelma Moreira, Luca Prigioniero +1
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 o…
On the Uniform Distribution of Regular Expressions
Sabine Broda, António Machiavelo, Nelma Moreira +1
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 o…
Report on Zhi-Wei Sun's "1-3-5 conjecture" and some of its refinements
António Machiavelo, Rogério Reis, Nikolaos Tsopanidis
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…
The computational power of parsing expression grammars
Bruno Loff, Nelma Moreira, Rogério Reis
We study the computational power of parsing expression grammars (PEGs). We begin by constructing PEGs with unexpected behaviour, and surprising new examples of languages with PEGs,…
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels
Stavros Konstantinidis, Nelma Moreira, Rogerio Reis +1
We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way---for example, the set of all word pairs u,v where v is a prefix…