Infix-free regular expressions and languages

Y. O.Sub Han, Yajun Wang, Derick Wood

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.

Original languageEnglish
Pages (from-to)379-393
Number of pages15
JournalInternational Journal of Foundations of Computer Science
Volume17
Issue number2
DOIs
Publication statusPublished - 2006 Apr 1

Fingerprint

Formal languages
Finite automata
Decomposition
Polynomials
Structural properties

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

Han, Y. O.Sub ; Wang, Yajun ; Wood, Derick. / Infix-free regular expressions and languages. In: International Journal of Foundations of Computer Science. 2006 ; Vol. 17, No. 2. pp. 379-393.
@article{7dfa66f0c2e846abafca190d3071ebc7,
title = "Infix-free regular expressions and languages",
abstract = "We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.",
author = "Han, {Y. O.Sub} and Yajun Wang and Derick Wood",
year = "2006",
month = "4",
day = "1",
doi = "10.1142/S0129054106003887",
language = "English",
volume = "17",
pages = "379--393",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

Infix-free regular expressions and languages. / Han, Y. O.Sub; Wang, Yajun; Wood, Derick.

In: International Journal of Foundations of Computer Science, Vol. 17, No. 2, 01.04.2006, p. 379-393.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Infix-free regular expressions and languages

AU - Han, Y. O.Sub

AU - Wang, Yajun

AU - Wood, Derick

PY - 2006/4/1

Y1 - 2006/4/1

N2 - We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.

AB - We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.

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

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

U2 - 10.1142/S0129054106003887

DO - 10.1142/S0129054106003887

M3 - Article

AN - SCOPUS:33746190608

VL - 17

SP - 379

EP - 393

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 2

ER -