Spider diagrams are a widely studied, visual logic that are able to make statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been established, including their soundness, completeness and expressiveness. In order to further enhance our understanding of spider diagrams, we can compare them with other languages; in the case of this paper we consider star-free regular languages. We establish relationships between various fragments of the spider diagram language and certain well-known subclasses of the star-free regular class. Utilising these relationships, given any spider diagram, we provide an upper-bound on the state complexity of minimal deterministic finite automata corresponding to that spider diagram. We further demonstrate cases where this bound is tight.
|Title of host publication||Proceedings of the 13th international conference on Distributed Multimedia Systems|
|Place of Publication||UT-Dallas, USA|
|Publisher||Knowledge Systems Institute|
|Number of pages||1|
|Publication status||Published - 1 Jan 2007|
|Event||Proceedings of the 13th international conference on Distributed Multimedia Systems - San Francisco, USA, 6-8 September, 2007|
Duration: 1 Jan 2007 → …
|Conference||Proceedings of the 13th international conference on Distributed Multimedia Systems|
|Period||1/01/07 → …|
Bibliographical noteCreative Commons Attribution Share-Alike license
- Spider diagrams
- visual languages
Delaney, A., & Stapleton, G. (2007). On the descriptional complexity of a diagrammatic notation. In Proceedings of the 13th international conference on Distributed Multimedia Systems (pp. 0-0). Knowledge Systems Institute.