Abstract
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:
-
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.
-
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.
-
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.
Preview
Unable to display preview. Download preview PDF.
5. References
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.
Book, R.V. (1976). Translational Lemmas, Polynomial Time, and (log n)j-Space. Theoretical Computer Science 1 (1976), 215–226.
Cook, S.A. (1971). Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. JACM 18 (1971), 4–18.
Hopcroft, J.E., Ullman, J.D. (1969 a). Formal Languages and their Relation to Automata. Addison-Wesley Publishing Company.
Hopcroft, J.E., Ullman, J.D. (1969 b). Some Results on Tape-Bounded Turing Machines. JACM 16 (1969), 168–177.
Mager, G. (1969). Writing Pushdown Automata. JCSS 3 (1969), 276–318.
Verbeek, R. (1976). private communication.
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandenburg, F.J. (1977). On one-way Auxiliary pushdown automata. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive