State complexity of basic operations on suffix-free regular languages

Yo-Sub Han, Kai Salomaa

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

7 Citations (Scopus)

Abstract

We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings
Pages501-512
Number of pages12
Publication statusPublished - 2007 Dec 1
Event32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 - Cesky Krumlov, Czech Republic
Duration: 2007 Aug 262007 Aug 31

Publication series

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

Other

Other32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007
CountryCzech Republic
CityCesky Krumlov
Period07/8/2607/8/31

Fingerprint

State Complexity
Suffix
Formal languages
Regular Languages
Language
Boolean Operation
Finite State Automata
Finite automata
Reversal
Stars
Star
Sufficient
Necessary
benzoylprop-ethyl

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Han, Y-S., & Salomaa, K. (2007). State complexity of basic operations on suffix-free regular languages. In Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings (pp. 501-512). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4708 LNCS).
Han, Yo-Sub ; Salomaa, Kai. / State complexity of basic operations on suffix-free regular languages. Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings. 2007. pp. 501-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{83ae7eaee43b4c7b977510cf2d0b04f4,
title = "State complexity of basic operations on suffix-free regular languages",
abstract = "We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.",
author = "Yo-Sub Han and Kai Salomaa",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540744559",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "501--512",
booktitle = "Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings",

}

Han, Y-S & Salomaa, K 2007, State complexity of basic operations on suffix-free regular languages. in Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4708 LNCS, pp. 501-512, 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, Cesky Krumlov, Czech Republic, 07/8/26.

State complexity of basic operations on suffix-free regular languages. / Han, Yo-Sub; Salomaa, Kai.

Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings. 2007. p. 501-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4708 LNCS).

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

TY - GEN

T1 - State complexity of basic operations on suffix-free regular languages

AU - Han, Yo-Sub

AU - Salomaa, Kai

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

AB - We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

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

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

M3 - Conference contribution

AN - SCOPUS:38049089885

SN - 9783540744559

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

SP - 501

EP - 512

BT - Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings

ER -

Han Y-S, Salomaa K. State complexity of basic operations on suffix-free regular languages. In Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings. 2007. p. 501-512. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).