research-article

Alternation for sublogarithmic space-bounded alternating pushdown automata

Authors:

Tsunehiro Yoshinaga,

Katsushi Inoue,

Akira ItoAuthors Info & Claims

Theoretical Computer Science, Volume 259, Issue 1

Pages 475 - 492

Published: 28 May 2001 Publication History

Abstract

This paper investigates infinite hierarchies on alternation-depth and alternation-size of alternating pushdown automata (apda's) with sublogarithmic space. We first show that there is an infinite hierarchy on alternation-depth for apda's with sublogarithmic space. We next investigate a relationship between alternation-depth and alternation-size, and show that for sublogarithmic space-bounded apda's, alternation-depth k is better than alternation-size k for each k 3. We finally show that there is an infinite hierarchy on alternation-size for apda's with sublogarithmic space.

References

[1]

B.V. Braunmühl, R. Gengler, R. Rettinger, The alternation hierarchy for sublogarithmic space is infinite, Comput. Complexity, 3 (1993) 207-230.

Digital Library

[2]

G. Buntrock, A. Hoene, Reversals and alternations, Proc. STACS-89, 1989, pp. 218-228.

Digital Library

[3]

A.K. Chandra, D.C. Kozen, L.J. Stockmeyer, Alternation, J. ACM, 28 (1981) 114-133.

Digital Library

[4]

J.H. Chang, O.H. Ibarra, B. Ravikumar, Some observations concerning alternating Turing machines using small space, Inform. Process. Lett. 25 (1987) 1-9. (Erratum: Inform. Process. Lett. 27 (1988) 53.)

Digital Library

[5]

P. Duris, Z. Galil, On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store, Inform. and Control, 54 (1982) 217-227.

[6]

V. Geffert, A hierarchy that does not collapse: alternations in low level space, Informatique théorique et Applications/Theoret. Inform. and Appl., 28 (1994) 465-512.

[7]

J.E. Hopcroft, J.D. Ullman, Addison-Wesley, Reading, MA, 1979.

[8]

K. Inoue, I. Takanami, R. Vollmar, Alternating on-line Turing machines with only universal states and small space bounds, Theoret. Comput. Sci., 41 (1985) 331-339.

Digital Library

[9]

K. Inoue, A. Ito, I. Takanami, A relationship between nondeterministic Turing machines and 1-inkdot Turing machines with small space, Inform. Process. Lett., 43 (1992) 225-227.

Digital Library

[10]

K. Inoue, A. Ito, I. Takanami, On 1-inkdot alternating Turing machines with small space, Theoret. Comput. Sci., 127 (1994) 171-179.

Digital Library

[11]

A. Ito, K. Inoue, I. Takanami, A note on alternating Turing machines using small space, IEICE Trans., E70 (1987) 990-996.

[12]

K.N. King, Alternating multihead finite automata, Theoret. Comput. Sci., 61 (1988) 149-174.

Digital Library

[13]

M. Li¿kiewicz, R. Reischuk, The sublogarithmic alternating space world, SIAM J. Comput., 25 (1996) 828-861.

Digital Library

[14]

D. Ranjan, R. Chang, J. Hartmanis, Space bounded computations: review and new separation results, Theoret. Comput. Sci., 80 (1991) 289-302.

Digital Library

[15]

A. Szepietowski, Springer, Berlin, 1994.

[16]

J. Xu, K. Inoue, Y. Wang, A. Ito, A note on alternating pushdown automata with sublogarithmic space, IEICE Trans., E79-D (1996) 259-270.

Cited By

Xu JLiu YYoshinaga T(2006)A note on non-closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) statesJournal of Computer Science and Technology10.1007/s11390-006-0979-721:6(979-983)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1007/s11390-006-0979-7

Index Terms

Alternation for sublogarithmic space-bounded alternating pushdown automata
1. Theory of computation
  1. Formal languages and automata theory
  2. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Sublogarithmic Space-bounded Multi-inkdot Alternating Pushdown Automata with Only Existential (Universal) States
JCAI '09: Proceedings of the 2009 International Joint Conference on Artificial Intelligence

This paper investigates some properties of two-way alternating pushdown automata with only existential (universal) states which have inkdots and sublogarithmic space. We show, for example, that for sublogarithmic space-bounded computations, multi-inkdot ...
Read More
A note on non-closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) states

1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input (with an inkdot) once. This paper investigates the closure property of sublogarithmic ...
Read More
Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States

This paper investigates the accepting powers of two-way alternating Turing machines (2ATM's) with only existential (universal) states which have inkdots and sublogarithmic space. It is shown that for sublogarithmic space-bounded computations, (i) multi-...
Read More

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 259, Issue 1

May 2001

681 pages

ISSN:0304-3975

Issue’s Table of Contents

Copyright © Elsevier Science B.V.

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 28 May 2001

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Xu JLiu YYoshinaga T(2006)A note on non-closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) statesJournal of Computer Science and Technology10.1007/s11390-006-0979-721:6(979-983)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1007/s11390-006-0979-7

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents