Chapman, Peter and Stapleton, Gem (2010) Introducing second order spider diagrams for defining regular languages In: 2010 IEEE Symposium on Visual Languages and Human-Centric Computing, 21 - 25 Sep 2010, Universidad Carlos III de Madrid.Full text not available from this repository.
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.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Subjects:||G000 Computing and Mathematical Sciences > G400 Computing|
|DOI (a stable link to the resource):||10.1109/VLHCC.2010.30|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||31 May 2011 14:05|
|Last Modified:||02 Mar 2015 14:17|
Actions (login required)
Downloads per month over past year