Skip to main navigation
Skip to search
Skip to main content

The University of Brighton Home

Home
Profiles
Research units
Equipment
Projects
Research output
Activities
Student theses

Search by expertise, name or affiliation

Defining star-free regular languages using diagrammatic logic

Aidan Delaney

University of Brighton

Research output: Thesis › Doctoral Thesis

Overview
Fingerprint

Fingerprint

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

Sort by
Weight
Alphabetically

Keyphrases

Computer Science

Mathematics

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2024 Elsevier B.V. or its licensors and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the Creative Commons licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

The University of Brighton data protection policy

About web accessibility

Report vulnerability