On purely morphic characterizations of context-free languages

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper we show the following: For any λ-free context-free language L there effectively exist a weak coding g, a homomorphism h such that L=gh-1 ({divides}cD2), where D2 is the Dyck set over a two-letter alphabet. As an immediate corollary it follows that for any λ-free context-free language L there exist a weak coding g and a mapping F such that L=gF-1({divides}c).

Original languageEnglish
Pages (from-to)301-308
Number of pages8
JournalTheoretical Computer Science
Volume51
Issue number3
DOIs
Publication statusPublished - 1987
Externally publishedYes

Fingerprint

Context free languages
Context-free Languages
Divides
Coding
Homomorphism
Corollary

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On purely morphic characterizations of context-free languages. / Yokomori, Takashi.

In: Theoretical Computer Science, Vol. 51, No. 3, 1987, p. 301-308.

Research output: Contribution to journalArticle

@article{3d1088349b3f42e691e7ea028b799121,
title = "On purely morphic characterizations of context-free languages",
abstract = "In this paper we show the following: For any λ-free context-free language L there effectively exist a weak coding g, a homomorphism h such that L=gh-1 ({divides}cD2), where D2 is the Dyck set over a two-letter alphabet. As an immediate corollary it follows that for any λ-free context-free language L there exist a weak coding g and a mapping F such that L=gF-1({divides}c).",
author = "Takashi Yokomori",
year = "1987",
doi = "10.1016/0304-3975(87)90038-7",
language = "English",
volume = "51",
pages = "301--308",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - On purely morphic characterizations of context-free languages

AU - Yokomori, Takashi

PY - 1987

Y1 - 1987

N2 - In this paper we show the following: For any λ-free context-free language L there effectively exist a weak coding g, a homomorphism h such that L=gh-1 ({divides}cD2), where D2 is the Dyck set over a two-letter alphabet. As an immediate corollary it follows that for any λ-free context-free language L there exist a weak coding g and a mapping F such that L=gF-1({divides}c).

AB - In this paper we show the following: For any λ-free context-free language L there effectively exist a weak coding g, a homomorphism h such that L=gh-1 ({divides}cD2), where D2 is the Dyck set over a two-letter alphabet. As an immediate corollary it follows that for any λ-free context-free language L there exist a weak coding g and a mapping F such that L=gF-1({divides}c).

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

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

U2 - 10.1016/0304-3975(87)90038-7

DO - 10.1016/0304-3975(87)90038-7

M3 - Article

VL - 51

SP - 301

EP - 308

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 3

ER -