Overlap-free regular languages

Yo Sub Han, Derick Wood

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

1 Citation (Scopus)

Abstract

We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
PublisherSpringer Verlag
Pages469-478
Number of pages10
ISBN (Print)3540369252, 9783540369257
Publication statusPublished - 2006 Jan 1
Event12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, Province of China
Duration: 2006 Aug 152006 Aug 18

Publication series

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

Other

Other12th Annual International Conference on Computing and Combinatorics, COCOON 2006
CountryTaiwan, Province of China
CityTaipei
Period06/8/1506/8/18

Fingerprint

Formal languages
Regular Languages
Overlap
Decomposition
Finite automata
Polynomials
Decompose
Finite State Automata
Regular Expressions
Language
Polynomial-time Algorithm
Strings
Distinct

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., & Wood, D. (2006). Overlap-free regular languages. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings (pp. 469-478). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS). Springer Verlag.
Han, Yo Sub ; Wood, Derick. / Overlap-free regular languages. Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag, 2006. pp. 469-478 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e12c3b535ebd4071bb710f96e66a2bea,
title = "Overlap-free regular languages",
abstract = "We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.",
author = "Han, {Yo Sub} and Derick Wood",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540369252",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "469--478",
booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",
address = "Germany",

}

Han, YS & Wood, D 2006, Overlap-free regular languages. in Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4112 LNCS, Springer Verlag, pp. 469-478, 12th Annual International Conference on Computing and Combinatorics, COCOON 2006, Taipei, Taiwan, Province of China, 06/8/15.

Overlap-free regular languages. / Han, Yo Sub; Wood, Derick.

Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag, 2006. p. 469-478 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS).

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

TY - GEN

T1 - Overlap-free regular languages

AU - Han, Yo Sub

AU - Wood, Derick

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.

AB - We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.

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

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

M3 - Conference contribution

AN - SCOPUS:33749541514

SN - 3540369252

SN - 9783540369257

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

SP - 469

EP - 478

BT - Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings

PB - Springer Verlag

ER -

Han YS, Wood D. Overlap-free regular languages. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag. 2006. p. 469-478. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).