State Complexity of Basic Operations on Non-Returning Regular Languages

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

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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
Issue number2
Publication statusPublished - 2016 Mar 4

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'State Complexity of Basic Operations on Non-Returning Regular Languages'. Together they form a unique fingerprint.

Cite this