Location of Repository

Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages

By Aidan Delaney, John Taylor and Simon Thompson

Abstract

The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool. Our interest is in using the logical basis of spider diagrams and the existing known equivalences between certain logics, formal language theory classes and some automata to inform the development of diagrammatic logics. Such developments could have many advantages, one of which would be aiding software engineers who are familiar with formal languages and automata to more intuitively understand diagrammatic logics. In this paper we consider relationships between spider diagrams of order (an extension of spider diagrams) and the star-free subset of regular languages. We extend the concept of the language of a spider diagram to encompass languages over arbitrary alphabets. Furthermore, the product of spider diagrams is introduced. This operator is the diagrammatic analogue of language concatenation. We establish that star-free languages are definable by spider diagrams of order equipped with the product operator and, based on this relationship, spider diagrams of order are as expressive as first order monadic logic of order

Topics: QA76
Year: 2008
OAI identifier: oai:kar.kent.ac.uk:24010

Suggested articles

Preview

Citations

  1. (1985). Characterizations of some classes of regular events. doi
  2. Classifying regular events in symbollic logic. doi
  3. (1997). Constraint diagrams: Visualizing invariants in object oriented modelling. doi
  4. (1991). Finite Model Theory. doi
  5. (1999). Formalising spider diagrams. doi
  6. (1992). Howard Straubing, and Denis Th erien. Some results on the generalized star-height problem. doi
  7. Lettres a une princesse dallemagne sur divers sujets de physique et de philosophie. doi
  8. (1995). Logic and Visual Information. doi
  9. (2002). On shue ideals.
  10. (2007). On the descriptional complexity of a diagrammatic notation.
  11. On the diagrammatic and mechanical representation of propositions and reasonings. doi
  12. (2007). Spider diagrams of order. doi
  13. (2005). Spider diagrams. doi
  14. (1997). Syntactic semigroups, doi
  15. (2004). The expressiveness of spider diagrams. doi
  16. (1994). The Logical Status of Diagrams. doi
  17. (1956). Three models for the description of language. doi
  18. (1960). Weak second order arithmetic and automata. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.