Article ID Journal Published Year Pages File Type
10358892 Journal of Visual Languages & Computing 2013 16 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Preview
On the expressiveness of spider diagrams and commutative star-free regular languages
Authors
, , , ,