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

Prefix-free
State Complexity
Formal languages
Regular Languages
Stars
Star
Star Operation
Reversal
Structural Properties
Automata
Union
Intersection
Structural properties

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
Han, Yo Sub ; Salomaa, Kai ; Yu, Sheng. / State complexity of combined operations for prefix-free regular languages. Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. 2009. pp. 398-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9384a6039f9f4e99849adc725f56d622,
title = "State complexity of combined operations for prefix-free regular languages",
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.",
author = "Han, {Yo Sub} and Kai Salomaa and Sheng Yu",
year = "2009",
month = "7",
day = "13",
doi = "10.1007/978-3-642-00982-2_34",
language = "English",
isbn = "9783642009815",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "398--409",
booktitle = "Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings",

}

Han, YS, 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5457, pp. 398-409, 3rd International Conference on Language and Automata Theory and Applications, LATA 2009, Tarragona, Spain, 09/4/2. https://doi.org/10.1007/978-3-642-00982-2_34

State complexity of combined operations for prefix-free regular languages. / Han, Yo Sub; Salomaa, Kai; Yu, Sheng.

Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. 2009. p. 398-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457).

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

TY - GEN

T1 - State complexity of combined operations for prefix-free regular languages

AU - Han, Yo Sub

AU - Salomaa, Kai

AU - Yu, Sheng

PY - 2009/7/13

Y1 - 2009/7/13

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-642-00982-2_34

DO - 10.1007/978-3-642-00982-2_34

M3 - Conference contribution

AN - SCOPUS:67649933933

SN - 9783642009815

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 398

EP - 409

BT - Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings

ER -

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