On the expressiveness of spider diagrams and commutative star-free regular languages

► We establish the expressiveness of spider diagrams with respect to formal languages. A characterisation of commutative star-free regular languages is also established. We show that spider diagrams define the commutative star-free regular languages.