Delaney, Aidan and Stapleton, Gem (2007) On the descriptional complexity of a diagrammatic notation In: Proceedings of the 13th international conference on Distributed Multimedia Systems, 6-8 Sep 2007, San Francisco, USA, 6-8 September, 2007.
VLC07-Delaney.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (242kB) | Preview
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.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Additional Information:||Creative Commons Attribution Share-Alike license|
|Uncontrolled Keywords:||Spider diagrams; visual languages|
|Subjects:||G000 Computing and Mathematical Sciences > G600 Software Engineering|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||26 Nov 2007|
|Last Modified:||12 Mar 2015 11:46|
Actions (login required)
Downloads per month over past year