State complexity of basic operations on non-returning regular languages

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 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, reversal, 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.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings
Pages54-65
Number of pages12
DOIs
Publication statusPublished - 2013 Sep 26
Event15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013 - London, ON, Canada
Duration: 2013 Jul 222013 Jul 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8031 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013
CountryCanada
CityLondon, ON
Period13/7/2213/7/25

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'State complexity of basic operations on non-returning regular languages'. Together they form a unique fingerprint.

  • Cite this

    Eom, H. S., Han, Y-S., & Jirásková, G. (2013). State complexity of basic operations on non-returning regular languages. In Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings (pp. 54-65). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8031 LNCS). https://doi.org/10.1007/978-3-642-39310-5_7