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

Delaney, Aidan and Stapleton, Gem and Taylor, John and Thompson, Simon (2013) On the expressiveness of spider diagrams and commutative star-free regular languages. Journal of Visual Languages and Computing, 24 (4). pp. 273-288. ISSN 1045-926X. (doi:https://doi.org/10.1016/j.jvlc.2013.02.001) (Full text available)

PDF
Download (519kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1016/j.jvlc.2013.02.001

Abstract

Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are equivalent in expressive power to monadic first-order logic with equality, MFOL[=]. In this paper, we further characterize their expressiveness by articulating a link between them and formal languages. First, we establish that spider diagrams define precisely the languages that are finite unions of languages of the form K {black small square} Γ*, where K is a finite commutative language and Γ is a finite set of letters. We note that it was previously established that spider diagrams define commutative star-free languages. As a corollary, all languages of the form K {black small square} Γ* are commutative star-free languages. We further demonstrate that every commutative star-free language is also such a finite union. In summary, we establish that spider diagrams define precisely: (a) languages definable in MFOL[=], (b) the commutative star-free regular languages, and (c) finite unions of the form K {black small square} Γ*, as just described.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science)
Divisions: Faculties > Sciences > School of Computing
Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Simon Thompson
Date Deposited: 11 Apr 2013 15:38 UTC
Last Modified: 07 Aug 2018 08:52 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/33572 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year