On purely morphic characterizations of context-free languages

研究成果: Article

3 引用 (Scopus)

抜粋

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).

元の言語English
ページ(範囲)301-308
ページ数8
ジャーナルTheoretical Computer Science
51
発行部数3
DOI
出版物ステータスPublished - 1987
外部発表Yes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント On purely morphic characterizations of context-free languages' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用