On one-way Auxiliary pushdown automata

  • F. -J. Brandenburg
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


A class of machines called one-way auxiliary pushdown automata, 1-APDA, is introduced. These machines differ from the well-known auxiliary pushdown automata by their input tape, which is one-way only. We restrict ourselves to f-tape-bounded 1-APDA with f(n) ≤ n and investigate some of their properties. In particular, it is shown:
  1. i)

    log log n is a lower bound for the tape complexity of 1-APDA to accept non-context-free languages, and this is a sharp bound.

  2. ii)

    If f(n) < n, i.e. if lim f(n) / n = O, then \(\{ w_1 cw_2 c\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\leftarrow}$}}{w} _1 c\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\leftarrow}$}}{w} _2 /w_1 ,w_2 \varepsilon \{ o,1\} ^ * ,\left| {w_1 } \right| = \left| {w_2 } \right|\}\) is not accepted by any f-tape-bounded 1-APDA.

  3. iii)

    For every f with f(n) < n, nondeterministic f-tape-bounded 1-APDA are strictly more powerful than deterministic f-tape-bounded 1-APDA. This is in opposition to (two-way) auxiliary pushdown automata and to f-tape-bounded 1-APDA with f(n) ≥ c.n.



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Book, R.V. (1975). Formal Language Theory and Theoretical Computer Science. Proceedings 2nd GI Conference, Automata Theory and Formal Languages, Kaiserslautern (1975), 1–16. Lecture Notes in Computer Science, No. 33.Google Scholar
  2. Book, R.V. (1976). Translational Lemmas, Polynomial Time, and (log n)j-Space. Theoretical Computer Science 1 (1976), 215–226.CrossRefGoogle Scholar
  3. Cook, S.A. (1971). Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. JACM 18 (1971), 4–18.CrossRefGoogle Scholar
  4. Hopcroft, J.E., Ullman, J.D. (1969 a). Formal Languages and their Relation to Automata. Addison-Wesley Publishing Company.Google Scholar
  5. Hopcroft, J.E., Ullman, J.D. (1969 b). Some Results on Tape-Bounded Turing Machines. JACM 16 (1969), 168–177.CrossRefGoogle Scholar
  6. Mager, G. (1969). Writing Pushdown Automata. JCSS 3 (1969), 276–318.Google Scholar
  7. Verbeek, R. (1976). private communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • F. -J. Brandenburg

There are no affiliations available

Personalised recommendations