Defining star-free regular languages using diagrammatic logic

Aidan Delaney

Defining star-free regular languages using diagrammatic logic

Aidan Delaney

University of Brighton

Research output: 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.

Original language	English
Qualification	Doctor of Philosophy
Awarding Institution	University of Brighton
Publication status	Published - Aug 2012

Bibliographical note

Access to Document

AidanDelaneyPhDThesisFinal.pdfOther version, 2.74 MBLicence: CC BY

Cite this

@phdthesis{59e2482ebe5a4bb0963089b138cfeee7,

title = "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.",

author = "Aidan Delaney",

note = "Copyright {\textcopyright} and Moral Rights for this thesis are retained by the author and/or other copyright owners.",

year = "2012",

month = aug,

language = "English",

school = "University of Brighton",

}

TY - BOOK

T1 - Defining star-free regular languages using diagrammatic logic

AU - Delaney, Aidan

PY - 2012/8

Y1 - 2012/8

N2 - 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.

AB - 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.

M3 - Doctoral Thesis

ER -

Defining star-free regular languages using diagrammatic logic

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this