State complexity of combined operations for prefix-free regular languages

Yo Sub Han, Kai Salomaa, Sheng Yu

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

7 Citations (Scopus)

Abstract

We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
Pages398-409
Number of pages12
DOIs
Publication statusPublished - 2009 Jul 13
Event3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain
Duration: 2009 Apr 22009 Apr 8

Publication series

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

Other

Other3rd International Conference on Language and Automata Theory and Applications, LATA 2009
CountrySpain
CityTarragona
Period09/4/209/4/8

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Salomaa, K., & Yu, S. (2009). State complexity of combined operations for prefix-free regular languages. In Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings (pp. 398-409). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457). https://doi.org/10.1007/978-3-642-00982-2_34