Two ways of introducing alternation into context-free grammars and pushdown automata

Etsuro Moriya, Friedrich Otto

    研究成果: Article

    3 引用 (Scopus)

    抄録

    Two ways of introducing alternation for context-free grammars and pushdown automata are compared. One is the usual way which combines "states" with alternation [1], [4], [7], and the other is the way used in [6] to define the alternating context-free grammar, i.e., alternation is governed by the variables of the grammar. In this paper the latter way is taken over to define a new type of alternating pushdown automaton by combining the "pushdown symbols" of the pushdown automaton with alternation. We have derived a characterization of the original alternating context-free grammars in terms of such a new type of alternating pushdown automaton without states. It is also shown that, if (non-alternating) states are introduced as an additional feature for this type of pushdown automaton, then the resulting alternating pushdown automaton has exactly the same expressive power as the original alternating pushdown automaton.

    元の言語English
    ページ(範囲)889-894
    ページ数6
    ジャーナルIEICE Transactions on Information and Systems
    E90-D
    発行部数6
    DOI
    出版物ステータスPublished - 2007 6

    Fingerprint

    Context free grammars

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Software
    • Artificial Intelligence
    • Hardware and Architecture
    • Computer Vision and Pattern Recognition

    これを引用

    Two ways of introducing alternation into context-free grammars and pushdown automata. / Moriya, Etsuro; Otto, Friedrich.

    :: IEICE Transactions on Information and Systems, 巻 E90-D, 番号 6, 06.2007, p. 889-894.

    研究成果: Article

    @article{058f14f60e3745b59deea74deb54abd2,
    title = "Two ways of introducing alternation into context-free grammars and pushdown automata",
    abstract = "Two ways of introducing alternation for context-free grammars and pushdown automata are compared. One is the usual way which combines {"}states{"} with alternation [1], [4], [7], and the other is the way used in [6] to define the alternating context-free grammar, i.e., alternation is governed by the variables of the grammar. In this paper the latter way is taken over to define a new type of alternating pushdown automaton by combining the {"}pushdown symbols{"} of the pushdown automaton with alternation. We have derived a characterization of the original alternating context-free grammars in terms of such a new type of alternating pushdown automaton without states. It is also shown that, if (non-alternating) states are introduced as an additional feature for this type of pushdown automaton, then the resulting alternating pushdown automaton has exactly the same expressive power as the original alternating pushdown automaton.",
    keywords = "Alternating context-free grammar, Alternating pushdown automaton, Alternation, Statealternating context-free grammar",
    author = "Etsuro Moriya and Friedrich Otto",
    year = "2007",
    month = "6",
    doi = "10.1093/ietisy/e90-d.6.889",
    language = "English",
    volume = "E90-D",
    pages = "889--894",
    journal = "IEICE Transactions on Information and Systems",
    issn = "0916-8532",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "6",

    }

    TY - JOUR

    T1 - Two ways of introducing alternation into context-free grammars and pushdown automata

    AU - Moriya, Etsuro

    AU - Otto, Friedrich

    PY - 2007/6

    Y1 - 2007/6

    N2 - Two ways of introducing alternation for context-free grammars and pushdown automata are compared. One is the usual way which combines "states" with alternation [1], [4], [7], and the other is the way used in [6] to define the alternating context-free grammar, i.e., alternation is governed by the variables of the grammar. In this paper the latter way is taken over to define a new type of alternating pushdown automaton by combining the "pushdown symbols" of the pushdown automaton with alternation. We have derived a characterization of the original alternating context-free grammars in terms of such a new type of alternating pushdown automaton without states. It is also shown that, if (non-alternating) states are introduced as an additional feature for this type of pushdown automaton, then the resulting alternating pushdown automaton has exactly the same expressive power as the original alternating pushdown automaton.

    AB - Two ways of introducing alternation for context-free grammars and pushdown automata are compared. One is the usual way which combines "states" with alternation [1], [4], [7], and the other is the way used in [6] to define the alternating context-free grammar, i.e., alternation is governed by the variables of the grammar. In this paper the latter way is taken over to define a new type of alternating pushdown automaton by combining the "pushdown symbols" of the pushdown automaton with alternation. We have derived a characterization of the original alternating context-free grammars in terms of such a new type of alternating pushdown automaton without states. It is also shown that, if (non-alternating) states are introduced as an additional feature for this type of pushdown automaton, then the resulting alternating pushdown automaton has exactly the same expressive power as the original alternating pushdown automaton.

    KW - Alternating context-free grammar

    KW - Alternating pushdown automaton

    KW - Alternation

    KW - Statealternating context-free grammar

    UR - http://www.scopus.com/inward/record.url?scp=56449123223&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=56449123223&partnerID=8YFLogxK

    U2 - 10.1093/ietisy/e90-d.6.889

    DO - 10.1093/ietisy/e90-d.6.889

    M3 - Article

    AN - SCOPUS:56449123223

    VL - E90-D

    SP - 889

    EP - 894

    JO - IEICE Transactions on Information and Systems

    JF - IEICE Transactions on Information and Systems

    SN - 0916-8532

    IS - 6

    ER -