Morphic characterizations of language families in terms of insertion systems and star languages

Fumiya Okubo, Takashi Yokomori

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations (like projections, weak-codings). For each k < 1, a language L is a k-star language if L = F+ for some finite set F with the length of each string in F is no more than k. The results of this kind have already been presented in [10] by Pun et al., while the purpose of this paper is to prove enhanced versions of them. Specifically, we show that each context-free language L can be represented in the form L = h(L(γ) ∩F+), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context-free manner), h is a projection, and F+ is a 2-star language. A similar characterization can be obtained for recursively enumerable languages, where insertion systems of weight (3, 3) and 2-star languages are involved.

Original languageEnglish
Pages (from-to)247-260
Number of pages14
JournalInternational Journal of Foundations of Computer Science
Volume22
Issue number1
DOIs
Publication statusPublished - Jan 1 2011

Fingerprint

Stars
Context free languages

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

Morphic characterizations of language families in terms of insertion systems and star languages. / Okubo, Fumiya; Yokomori, Takashi.

In: International Journal of Foundations of Computer Science, Vol. 22, No. 1, 01.01.2011, p. 247-260.

Research output: Contribution to journalArticle

@article{96e0c6a922a84fd5a712af4f28befc94,
title = "Morphic characterizations of language families in terms of insertion systems and star languages",
abstract = "Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations (like projections, weak-codings). For each k < 1, a language L is a k-star language if L = F+ for some finite set F with the length of each string in F is no more than k. The results of this kind have already been presented in [10] by Pun et al., while the purpose of this paper is to prove enhanced versions of them. Specifically, we show that each context-free language L can be represented in the form L = h(L(γ) ∩F+), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context-free manner), h is a projection, and F+ is a 2-star language. A similar characterization can be obtained for recursively enumerable languages, where insertion systems of weight (3, 3) and 2-star languages are involved.",
author = "Fumiya Okubo and Takashi Yokomori",
year = "2011",
month = "1",
day = "1",
doi = "10.1142/S012905411100799X",
language = "English",
volume = "22",
pages = "247--260",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - Morphic characterizations of language families in terms of insertion systems and star languages

AU - Okubo, Fumiya

AU - Yokomori, Takashi

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations (like projections, weak-codings). For each k < 1, a language L is a k-star language if L = F+ for some finite set F with the length of each string in F is no more than k. The results of this kind have already been presented in [10] by Pun et al., while the purpose of this paper is to prove enhanced versions of them. Specifically, we show that each context-free language L can be represented in the form L = h(L(γ) ∩F+), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context-free manner), h is a projection, and F+ is a 2-star language. A similar characterization can be obtained for recursively enumerable languages, where insertion systems of weight (3, 3) and 2-star languages are involved.

AB - Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations (like projections, weak-codings). For each k < 1, a language L is a k-star language if L = F+ for some finite set F with the length of each string in F is no more than k. The results of this kind have already been presented in [10] by Pun et al., while the purpose of this paper is to prove enhanced versions of them. Specifically, we show that each context-free language L can be represented in the form L = h(L(γ) ∩F+), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context-free manner), h is a projection, and F+ is a 2-star language. A similar characterization can be obtained for recursively enumerable languages, where insertion systems of weight (3, 3) and 2-star languages are involved.

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

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

U2 - 10.1142/S012905411100799X

DO - 10.1142/S012905411100799X

M3 - Article

AN - SCOPUS:79251647157

VL - 22

SP - 247

EP - 260

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 1

ER -