A grammatical characterization of alternating pushdown automata

Etsuro Moriya

研究成果: Article

13 引用 (Scopus)

抜粋

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
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Computational Theory and Mathematics

これを引用