| Presentation | 1993/4/23 A simulation result for simultaneously bounded AuxPDAs Tetsuro Nishino, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper,we show that AuxSpTu(S(n),T(n))AMNSPACE(S(n)・ logT(n)),where AuxSpTu(S(n),T(n))is the class of languages accepted by nondeterministic auxiliary pushdown automata operating simultaneously in O(S(n))space and O(T(n))turns of the auxiliary tape head. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | computational complexity theory / auxiliary pushdown automaton |
| Paper # | COMP93-1 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1993/4/23(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A simulation result for simultaneously bounded AuxPDAs |
| Sub Title (in English) | |
| Keyword(1) | computational complexity theory |
| Keyword(2) | auxiliary pushdown automaton |
| 1st Author's Name | Tetsuro Nishino |
| 1st Author's Affiliation | Japan Advanced Institute of Science and Technology,Hokuriku() |
| Date | 1993/4/23 |
| Paper # | COMP93-1 |
| Volume (vol) | vol.93 |
| Number (no) | 19 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |