Defining star-free regular languages using diagrammatic logic

  • Aidan Delaney

Student thesis: Doctoral 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.
Date of AwardAug 2012
Original languageEnglish
Awarding Institution
  • University of Brighton

Cite this

Defining star-free regular languages using diagrammatic logic
Delaney, A. (Author). Aug 2012

Student thesis: Doctoral Thesis