State complexity of basic operations on suffix-free regular languages

Yo-Sub Han, Kai Salomaa

Research output: Contribution to journalArticle

50 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
Pages (from-to)2537-2548
Number of pages12
JournalTheoretical Computer Science
Volume410
Issue number27-29
DOIs
Publication statusPublished - 2009 Jun 28

Fingerprint

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{fdda1eb108b144aeb88d2e8de11a23ae,
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 = "2009",
month = "6",
day = "28",
doi = "10.1016/j.tcs.2008.12.054",
language = "English",
volume = "410",
pages = "2537--2548",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "27-29",

}

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

In: Theoretical Computer Science, Vol. 410, No. 27-29, 28.06.2009, p. 2537-2548.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Han, Yo-Sub

AU - Salomaa, Kai

PY - 2009/6/28

Y1 - 2009/6/28

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=67349252734&partnerID=8YFLogxK

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

U2 - 10.1016/j.tcs.2008.12.054

DO - 10.1016/j.tcs.2008.12.054

M3 - Article

AN - SCOPUS:67349252734

VL - 410

SP - 2537

EP - 2548

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 27-29

ER -