3 citations · 5 across the 4 of their papers we have counts for
4 papers
Guillotine and Tiling Cofiniteness in Unary Picture Languages
Pierluigi San Pietro, Stefano Crespi Reghizzi, Antonio Restivo
Motivated by the study of closure operations on picture languages, we ask when a set of unary tiles can generate all sufficiently large pictures either via repeated horizontal and…
Minimizing speculation overhead in a parallel recognizer for regular texts
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi +1
Speculative data-parallel algorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministi…
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
Dino Mandrioli, Matteo Pradella, Stefano Crespi Reghizzi
A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or f…
Formal semantics of language and the Richard-Berry paradox
Stefano Crespi Reghizzi
The classical logical antinomy known as Richard-Berry paradox is combined with plausible assumptions about the size i.e. the descriptional complexity of Turing machines formalizing…