ResearchSpace
→
Browsing by Subject

Browsing by Subject "Descriptional complexity"

Now showing items 1-2 of 2

Descriptional complexity of non-unary self-verifying symmetric difference automata

Author: Marais, Laurette ; Van Zijl, L Date: May 2022 Unary self-verifying symmetric difference automata have a known tight bound of 2n-1-1 for their state complexity. We now consider the non-unary case and show that, for every n=2, there is a regular language Ln accepted by a non-unary ... Read more
The state complexity of language operations on XNFA-succinct unary regular languages

Author: Marais, Laurette ; Van Zijl, L Date: Sep 2018 Given two unary languages accepted by symmetric difference non-deterministic finite automata, we establish bounds on the state complexity of their union, intersection, relative complement and symmetric difference. For languages L1 and L2 ... Read more

Now showing items 1-2 of 2

Browse

All of ResearchSpace

Quick Links

Legislation and compliance

General Enquiries

Tel: + 27 12 841 2911
Email: callcentre@csir.co.za

Physical Address
Meiring Naudé Road
Brummeria
Pretoria
South Africa

Postal Address
PO Box 395
Pretoria 0001
South Africa

Social Connect

Resources on this site are free to download and reuse according to associated licensing provision. Please read the terms and conditions of usage of each resource.

Browsing by Subject "Descriptional complexity"

Browsing by Subject "Descriptional complexity"

Browse

All of ResearchSpace

Quick Links

Legislation and compliance

General Enquiries

Social Connect