抄録
The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 75-85 |
| ページ数 | 11 |
| ジャーナル | Theoretical Computer Science |
| 巻 | 67 |
| 号 | 1 |
| DOI | |
| 出版ステータス | Published - 1989 9月 5 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 計算理論と計算数学