Intersection with regular languages for RDFAwtw

Ascertain whether the language class L(RDFAwtw) is closed under intersection with regular languages.

Background

For non-repetitive models, certain intersections (including with regular languages) are not closed. The paper shows RDFAwtw is not closed under union and alphabetic morphisms, and it notes that intersection with sets of the form K* (for finite prefix codes K) is closed.

The general question of closure under intersection with arbitrary regular languages remains unresolved for RDFAwtw.