On the space complexity of turn bounded pushdown automata

Etsuro Moriya, Takemaru Tada

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)295-304
    Number of pages10
    JournalInternational Journal of Computer Mathematics
    Volume80
    Issue number3
    DOIs
    Publication statusPublished - 2003 Mar

      Fingerprint

    Keywords

    • Pushdown automaton
    • Space complexity
    • Turn (head reversal)

    ASJC Scopus subject areas

    • Applied Mathematics

    Cite this