Introducing second order spider diagrams for defining regular languages

Peter Chapman, Gem Stapleton

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBN

Abstract

There has been significant research effort focussed on the study of regular languages, since they play a vital role in our understanding of computation. This existing research draws a large number of connections with other areas, such as algebra and symbolic logic. Recently, research has begun into how diagrammatic logics can define regular languages, providing another mechanism through which we can understand regular languages. However, the formalised diagrammatic logics are first-order, so they cannot define non-starfree regular languages. The primary contributions of this paper are: (a) to develop and formalise a second-order diagrammatic logic, extending spider diagrams of order, and (b) to establish a class of regular languages that this logic can define. This lays the essential foundations for providing an exact classification of the regular languages that are definable using this new second-order logic.
Original languageEnglish
Title of host publication2010 IEEE Symposium on Visual Languages and Human-Centric Computing
Place of PublicationWashington DC, USA
Pages159-167
Number of pages9
DOIs
Publication statusPublished - 1 Jan 2010
Event2010 IEEE Symposium on Visual Languages and Human-Centric Computing - Universidad Carlos III de Madrid
Duration: 1 Jan 2010 → …

Conference

Conference2010 IEEE Symposium on Visual Languages and Human-Centric Computing
Period1/01/10 → …

Fingerprint Dive into the research topics of 'Introducing second order spider diagrams for defining regular languages'. Together they form a unique fingerprint.

  • Cite this

    Chapman, P., & Stapleton, G. (2010). Introducing second order spider diagrams for defining regular languages. In 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (pp. 159-167). https://doi.org/10.1109/VLHCC.2010.30