4 citations · 5 across the 2 of their papers we have counts for
3 papers
math.CO2014★ 1 cited
Composing short 3-compressing words on a 2 letter alphabet
Alessandra Cherubini, Achille Frigeri, Zuhua Liu
A finite deterministic (semi)automaton is -compressible if there is some word such that the image of its state set under the natural action…
math.GR2013★ 4 cited
Maximal subgroups of amalgams of finite inverse semigroups
Alessandra Cherubini, Tatiana B. Jajcayova, Emanuele Rodaro
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. S…
cs.FL2009
A unifying approach to picture grammars
Matteo Pradella, Alessandra Cherubini, Stefano Crespi Reghizzi
Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such gra…