Complementation closure for RDFAwtw

Ascertain whether the language class L(RDFAwtw) is closed under complementation.

Background

The authors prove that RDFAwtws have heightened expressiveness and undecidable properties. They also note that the complement of a language accepted by an RDFAwtw is accepted by an RNFAwtw, but this does not settle whether RDFAwtw itself is closed under complementation.

Given known non-closure results (e.g., union and alphabetic morphisms) for RDFAwtw, complementation remains a central unresolved closure operation for the deterministic repetitive model.