State Complexity of Basic Operations on Non-Returning Regular Languages

Hae Sung Eom, Yo Sub Han, Galina Jirásková

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reverse, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regular languages and larger than the state complexities for suffix-free regular languages. In the case of catenation and reversal, we define witness languages over a ternary alphabet. Then we provide lower bounds for a binary alphabet. For every operation, we also study the unary case.

Original languageEnglish
Pages (from-to)161-182
Number of pages22
JournalFundamenta Informaticae
Volume144
Issue number2
DOIs
Publication statusPublished - 2016 Mar 4

Fingerprint

State Complexity
Formal languages
Regular Languages
Boolean Operation
Suffix
Unary
Reversal
Ternary
Stars
Reverse
Star
Union
Intersection
Binary
Lower bound

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

Eom, Hae Sung ; Han, Yo Sub ; Jirásková, Galina. / State Complexity of Basic Operations on Non-Returning Regular Languages. In: Fundamenta Informaticae. 2016 ; Vol. 144, No. 2. pp. 161-182.
@article{d4bdc6f4028f476ab15aca48d15d81c1,
title = "State Complexity of Basic Operations on Non-Returning Regular Languages",
abstract = "We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reverse, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regular languages and larger than the state complexities for suffix-free regular languages. In the case of catenation and reversal, we define witness languages over a ternary alphabet. Then we provide lower bounds for a binary alphabet. For every operation, we also study the unary case.",
author = "Eom, {Hae Sung} and Han, {Yo Sub} and Galina Jir{\'a}skov{\'a}",
year = "2016",
month = "3",
day = "4",
doi = "10.3233/FI-2016-1326",
language = "English",
volume = "144",
pages = "161--182",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "2",

}

State Complexity of Basic Operations on Non-Returning Regular Languages. / Eom, Hae Sung; Han, Yo Sub; Jirásková, Galina.

In: Fundamenta Informaticae, Vol. 144, No. 2, 04.03.2016, p. 161-182.

Research output: Contribution to journalArticle

TY - JOUR

T1 - State Complexity of Basic Operations on Non-Returning Regular Languages

AU - Eom, Hae Sung

AU - Han, Yo Sub

AU - Jirásková, Galina

PY - 2016/3/4

Y1 - 2016/3/4

N2 - We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reverse, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regular languages and larger than the state complexities for suffix-free regular languages. In the case of catenation and reversal, we define witness languages over a ternary alphabet. Then we provide lower bounds for a binary alphabet. For every operation, we also study the unary case.

AB - We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reverse, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regular languages and larger than the state complexities for suffix-free regular languages. In the case of catenation and reversal, we define witness languages over a ternary alphabet. Then we provide lower bounds for a binary alphabet. For every operation, we also study the unary case.

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

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

U2 - 10.3233/FI-2016-1326

DO - 10.3233/FI-2016-1326

M3 - Article

AN - SCOPUS:84960460494

VL - 144

SP - 161

EP - 182

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 2

ER -