On the space complexity of turn bounded pushdown automata

Etsuro Moriya*, Takemaru Tada

*この研究の対応する著者

    研究成果: Article査読

    2 被引用数 (Scopus)

    抄録

    A pushdown automaton is said to make a turn at a given instant if it changes at that instant from stack increasing to stack decreasing. Let NPDA-TURN(f(n)) and DPDA-TURN(f(n)) denote the classes of languages accepted by nondeterministic and deterministic pushdown automata respectively that make at most f(n) turns for any input of length n. In this paper the following inclusions that express the space complexity of turn bounded pushdown automata are given: DPDA-TURN(f(n)) ⊆ DSPACE(log f(n) log n), and NPDA-TURN(f(n)) ⊆ NSPACE (log f(n) log n). In particular, it follows that finite-turn pushdown automata are logarithmic space bounded: DPDA-TURN(O(1)) ⊆ DL and NPDA-TURN(O(1)) ⊆ NL, from which two corollaries follow: one is that the class of metalinear context-free languages is complete for NL, and the other is that a more tight inclusion NPDA-TURN(f(n)) ⊆ DSPACE(log2 f(n) log n) cannot be derived unless DL = NL, though NPDA-TURN (f(n)) ⊆ DSPACE(log2 f(n) log2 n) holds.

    本文言語English
    ページ(範囲)295-304
    ページ数10
    ジャーナルInternational Journal of Computer Mathematics
    80
    3
    DOI
    出版ステータスPublished - 2003 3

    ASJC Scopus subject areas

    • 応用数学

    フィンガープリント

    「On the space complexity of turn bounded pushdown automata」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル