| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 2, 2009>>> |
 Magyarul
|
Languages Convex with Respect to Binary Relations, and Their Closure Properties
Thomas Ang and Janusz Brzozowski
Abstract (in LaTeX format)
A language is prefix-convex if it satisfies the condition that, if a word $w$ and its prefix $u$ are in the language, then so is every prefix of $w$ that has $u$ as a prefix. Prefix-convex languages include prefix-closed languages at one end of the spectrum, and prefix-free languages, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword-convex languages and their closed and free counterparts. This provides a common framework for diverse languages such as codes, factorial languages and ideals. We examine the relationships among these languages. We generalize these notions to arbitrary binary relations on the set of all words over a given alphabet, and study the closure properties of such languages.
Kewords: closed, closure, code, convex, factor, factorial, free, ideal, relation, language, prefix, subword, suffix.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Ang:2009:ActaCybernetica,author = {Thomas Ang and Janusz Brzozowski},
title = {Languages Convex with Respect to Binary Relations, and Their Closure Properties},
journal = {Acta Cybernetica},
volume = {19},
number= {2},
pages = {445--464},
year = {2009},
abstract = {A language is prefix-convex if it satisfies the condition that, if a word $w$ and its prefix $u$ are in the language, then so is every prefix of $w$ that has $u$ as a prefix. Prefix-convex languages include prefix-closed languages at one end of the spectrum, and prefix-free languages, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword-convex languages and their closed and free counterparts. This provides a common framework for diverse languages such as codes, factorial languages and ideals. We examine the relationships among these languages. We generalize these notions to arbitrary binary relations on the set of all words over a given alphabet, and study the closure properties of such languages.},
keywords = {closed, closure, code, convex, factor, factorial, free, ideal, relation, language, prefix, subword, suffix}
}