On state-alternating context-free grammars

Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto

    研究成果: Article

    13 引用 (Scopus)

    抜粋

    State-alternating context-free grammars are introduced, and the language classes obtained from them are compared to the classes of the Chomsky hierarchy as well as to some well-known complexity classes. In particular, state-alternating context-free grammars are compared to alternating context-free grammars (Theoret. Comput. Sci. 67 (1989) 75-85) and to alternating pushdown automata. Further, various derivation strategies are considered, and their influence on the expressive power of (state-) alternating context-free grammars is investigated.

    元の言語English
    ページ(範囲)183-216
    ページ数34
    ジャーナルTheoretical Computer Science
    337
    発行部数1-3
    DOI
    出版物ステータスPublished - 2005 6 9

    ASJC Scopus subject areas

    • Computational Theory and Mathematics

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

  • これを引用

    Moriya, E., Hofbauer, D., Huber, M., & Otto, F. (2005). On state-alternating context-free grammars. Theoretical Computer Science, 337(1-3), 183-216. https://doi.org/10.1016/j.tcs.2004.12.029