Defining star-free regular languages using diagrammatic logic

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 Award	Aug 2012
Original language	English
Awarding Institution	University of Brighton