Alternation for sublogarithmic space-bounded alternating pushdown automata

Citation
Jl. Xu et al., Alternation for sublogarithmic space-bounded alternating pushdown automata, THEOR COMP, 259(1-2), 2001, pp. 475-492
Citations number
16
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
259
Issue
1-2
Year of publication
2001
Pages
475 - 492
Database
ISI
SICI code
0304-3975(20010528)259:1-2<475:AFSSAP>2.0.ZU;2-7
Abstract
This paper investigates infinite hierarchies on alternation-depth and alter nation-size of alternating pushdown automata (apda's) with sublogarithmic s pace. We first show that there is an infinite hierarchy on alternation-dept h for apda's with sublogarithmic space. We next investigate a relationship between alternation-depth and alternation-size, and show that for sublogari thmic space-bounded apda's, alternation-depth k is better than alternation- size k for each k greater than or equal to3. We finally show that there is an infinite hierarchy on alternation-size for apda's with sublogarithmic sp ace. (C) 2001 Elsevier Science B.V. All rights reserved.