The University of Waterloo Libraries will be performing maintenance on UWSpace tomorrow, November 5th, 2025, from 10 am – 6 pm EST.
UWSpace will be offline for all UW community members during this time. Please avoid submitting items to UWSpace until November 7th, 2025.

Complexity of Suffix-Free Regular Languages

Thumbnail Image

Files

Complexity_Suff-Free15-s.pdf (337.91 KB)

Date

2017-11-01

Authors

Brzozowski, Janusz
Szykuła, Marek

Advisor

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Abstract

We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the complexity upper bounds for all basic measures. It is known that there exist such most complex sequences in several classes of regular languages. In contrast to this, we prove that there does not exist a most complex sequence in the class of suffix-free regular languages. However, we do exhibit two such sequences that together meet upper bounds for all basic measures.

Description

The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.jcss.2017.05.011 © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Keywords

Most complex, Regular language, State complexity, Suffix-Free, Syntactic complexity, Transition semigroup

LC Subject Headings

Citation

URI

http://dx.doi.org/10.1016/j.jcss.2017.05.011
 http://hdl.handle.net/10012/12497

Collections

Waterloo Research
Computer Science