Defining star-free regular languages using diagrammatic logic

Aidan Delaney

Research output: ThesisDoctoral ThesisResearch

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

Fingerprint

Regular
Logic
Diagrams
Language
Cardinality

Bibliographical note

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

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 {\circledC} and Moral Rights for this thesis are retained by the author and/or other copyright owners.",
year = "2012",
month = "8",
language = "English",
school = "University of Brighton",

}

Delaney, A 2012, 'Defining star-free regular languages using diagrammatic logic', Doctor of Philosophy, University of Brighton.

Defining star-free regular languages using diagrammatic logic. / Delaney, Aidan.

2012. 294 p.

Research output: ThesisDoctoral ThesisResearch

TY - THES

T1 - Defining star-free regular languages using diagrammatic logic

AU - Delaney, Aidan

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

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 -