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

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this