抜粋
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)