| Presentation | 1999/12/10 Probabilistic Rebound Turing Machines Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fundamental property of the machine. Let £∣PRTM(o(log n))∣ denote the class of languages recognized by o(log n space bounded PRTM's with error probability less than 1/2. We first prove a lower space bound for PRTM's We then show, by using the lower space bound and an idea in the proof of it, that (1) £∣PRTM(o(log n))∣ is incomparable with the class of context-free languages, (2) there is a language accepted by a two-way deterministic one counter automaton, but not in £∣PRTM(o(log n))∣. and (3) there is a language accepted by a deterministic one-marker rebound automaton, but not in £∣PRTM(o(log n))∣. Furthermore, we show that there is an infinite space hierarchy for £∣PRTM(o(log n))∣. We finally Show that £∣PRTM(o(log n))∣ is not close under concatenation, Kleene +, and length-preserving homomorphism. This paper answers two open problems in a previous paper. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | probabilistic rebound Turing machine / rebound automaton / space hierarchy / closure propety |
| Paper # | COMP99-67 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1999/12/10(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) | Probabilistic Rebound Turing Machines |
| Sub Title (in English) | |
| Keyword(1) | probabilistic rebound Turing machine |
| Keyword(2) | rebound automaton |
| Keyword(3) | space hierarchy |
| Keyword(4) | closure propety |
| 1st Author's Name | Lan Zhang |
| 1st Author's Affiliation | Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University() |
| 2nd Author's Name | Katsushi Inoue |
| 2nd Author's Affiliation | Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University |
| 3rd Author's Name | Akira Ito |
| 3rd Author's Affiliation | Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University |
| 4th Author's Name | Yue Wang |
| 4th Author's Affiliation | Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University |
| Date | 1999/12/10 |
| Paper # | COMP99-67 |
| Volume (vol) | vol.99 |
| Number (no) | 492 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |