Nondeterministic state complexity of basic operations for prefix-free regular languages

Yo Sub Han, Kai Salomaa, Derick Wood

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)93-106
Number of pages14
JournalFundamenta Informaticae
Volume90
Issue number1-2
DOIs
Publication statusPublished - 2009 Mar 9

Fingerprint

Prefix-free
State Complexity
Formal languages
Regular Languages
Finite automata
Stars
Finite State Automata
Complementation
Reversal
Star
Union
Intersection
Sufficient
Necessary

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Algebra and Number Theory

Cite this

@article{33a6d328ab2d47f4a9d98b96b57cf28e,
title = "Nondeterministic state complexity of basic operations for prefix-free regular languages",
abstract = "We investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.",
author = "Han, {Yo Sub} and Kai Salomaa and Derick Wood",
year = "2009",
month = "3",
day = "9",
doi = "10.3233/FI-2009-0008",
language = "English",
volume = "90",
pages = "93--106",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

Nondeterministic state complexity of basic operations for prefix-free regular languages. / Han, Yo Sub; Salomaa, Kai; Wood, Derick.

In: Fundamenta Informaticae, Vol. 90, No. 1-2, 09.03.2009, p. 93-106.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Nondeterministic state complexity of basic operations for prefix-free regular languages

AU - Han, Yo Sub

AU - Salomaa, Kai

AU - Wood, Derick

PY - 2009/3/9

Y1 - 2009/3/9

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

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

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

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

U2 - 10.3233/FI-2009-0008

DO - 10.3233/FI-2009-0008

M3 - Article

VL - 90

SP - 93

EP - 106

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -