Outfix-free regular languages and prime outfix-free decomposition

Yo-Sub Han, Derick Wood

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A string x is an outfix of a string y if there is a string w such that x_1wx_2 = y and x = x_1x_2. A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two cases: 1) a language is given as a finite set of strings and 2) a language is given by a finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfixfree regular languages and design a linear-time algorithm that computes prime outfix-free decomposition for outfix-free regular languages. We also demonstrate the uniqueness of prime outfix-free decomposition.

Original languageEnglish
Pages (from-to)441-457
Number of pages17
JournalFundamenta Informaticae
Volume81
Issue number4
Publication statusPublished - 2007 Dec 1

Fingerprint

Formal languages
Regular Languages
Strings
Decomposition
Decompose
Finite automata
Polynomials
Finite State Automata
Linear-time Algorithm
Polynomial-time Algorithm
Finite Set
Uniqueness

All Science Journal Classification (ASJC) codes

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

Cite this

@article{cfde80f66a6f46d6aaf62fc6ca38786e,
title = "Outfix-free regular languages and prime outfix-free decomposition",
abstract = "A string x is an outfix of a string y if there is a string w such that x_1wx_2 = y and x = x_1x_2. A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two cases: 1) a language is given as a finite set of strings and 2) a language is given by a finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfixfree regular languages and design a linear-time algorithm that computes prime outfix-free decomposition for outfix-free regular languages. We also demonstrate the uniqueness of prime outfix-free decomposition.",
author = "Yo-Sub Han and Derick Wood",
year = "2007",
month = "12",
day = "1",
language = "English",
volume = "81",
pages = "441--457",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "4",

}

Outfix-free regular languages and prime outfix-free decomposition. / Han, Yo-Sub; Wood, Derick.

In: Fundamenta Informaticae, Vol. 81, No. 4, 01.12.2007, p. 441-457.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Outfix-free regular languages and prime outfix-free decomposition

AU - Han, Yo-Sub

AU - Wood, Derick

PY - 2007/12/1

Y1 - 2007/12/1

N2 - A string x is an outfix of a string y if there is a string w such that x_1wx_2 = y and x = x_1x_2. A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two cases: 1) a language is given as a finite set of strings and 2) a language is given by a finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfixfree regular languages and design a linear-time algorithm that computes prime outfix-free decomposition for outfix-free regular languages. We also demonstrate the uniqueness of prime outfix-free decomposition.

AB - A string x is an outfix of a string y if there is a string w such that x_1wx_2 = y and x = x_1x_2. A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two cases: 1) a language is given as a finite set of strings and 2) a language is given by a finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfixfree regular languages and design a linear-time algorithm that computes prime outfix-free decomposition for outfix-free regular languages. We also demonstrate the uniqueness of prime outfix-free decomposition.

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

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

M3 - Article

AN - SCOPUS:38049119795

VL - 81

SP - 441

EP - 457

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 4

ER -