Defining star-free regular languages using diagrammatic logic

Aidan Delaney

Research output: ThesisDoctoral Thesis

Abstract

Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and their cardinalities. By contrast, the study of regular languages is one of the oldest active branches of computer science research. The work in this thesis examines the previously unstudied relationship between spider diagrams and regular languages.
Original languageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • University of Brighton
Publication statusPublished - Aug 2012

Bibliographical note

Copyright © and Moral Rights for this thesis are retained by the author and/or other copyright owners.

Fingerprint Dive into the research topics of 'Defining star-free regular languages using diagrammatic logic'. Together they form a unique fingerprint.

  • Cite this