State Complexity of Boundary of Prefix-Free Regular Languages

Hae Sung Eom, Yo Sub Han

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Recently, researchers studied the state complexity of boundary - L ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L and L ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L and L ∩Lc∗. We then present the tight bound over a quaternary alphabet for L and L ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.

Original languageEnglish
Pages (from-to)697-707
Number of pages11
JournalInternational Journal of Foundations of Computer Science
Volume26
Issue number6
DOIs
Publication statusPublished - 2015 Sep 1

Fingerprint

Formal languages
Structural properties
Chemical analysis

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@article{1858dcfed42443f2a9b84884808a19df,
title = "State Complexity of Boundary of Prefix-Free Regular Languages",
abstract = "Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.",
author = "Eom, {Hae Sung} and Han, {Yo Sub}",
year = "2015",
month = "9",
day = "1",
doi = "10.1142/S0129054115500392",
language = "English",
volume = "26",
pages = "697--707",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "6",

}

State Complexity of Boundary of Prefix-Free Regular Languages. / Eom, Hae Sung; Han, Yo Sub.

In: International Journal of Foundations of Computer Science, Vol. 26, No. 6, 01.09.2015, p. 697-707.

Research output: Contribution to journalArticle

TY - JOUR

T1 - State Complexity of Boundary of Prefix-Free Regular Languages

AU - Eom, Hae Sung

AU - Han, Yo Sub

PY - 2015/9/1

Y1 - 2015/9/1

N2 - Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.

AB - Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.

UR - http://www.scopus.com/inward/record.url?scp=84947221178&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947221178&partnerID=8YFLogxK

U2 - 10.1142/S0129054115500392

DO - 10.1142/S0129054115500392

M3 - Article

AN - SCOPUS:84947221178

VL - 26

SP - 697

EP - 707

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -