Abstract
This paper shows a sublogarithmic space lower bound for two-dimensional probabilistic Turing machines (2-ptm’s) over square tapes with bounded error, and shows, using this space lower bound theorem, that a specific set is not recognized by any o(log n) space-bounded 2- ptm. Furthermore, the paper investigates a relationship between 2-ptm's and two-dimensional Turing machines with both nondeterministic and probabilistic states, which we call “two-dimensional stochastic Turing machines (2-stm’s)”, and shows that for any loglog n ≤ L(n) = o(log n), L(n) space-bounded 2-ptm’s with bounded error are less powerful than L(n) space-bounded 2-stm’s with bounded error which start in nondeterministic mode, and make only one alternation between nondeterministic and probabilistic modes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Condon, L. Hellerstein, S. Pottle and A. Wigderson, “On the power of finite automata with both nondeterministic and probabilistic states”, SIAM J.COMPUT., vol.27, no.3, pp.739–762 (1998).
C. Dwork and L. Stockmeyer, “Finite state verifier I:The power of interaction”, J.ACM, vol.39, no.4, pp.800–828 (1992).
R. Freivalds, “Probabilistic two-way machines”, In proceedings of the International Symposium on Mathematical Foundations of Computer Science. LNCS 118, pp.33–45 (1981).
R. Freivalds and M. karpinski, “Lower space bounds for randomized computation”, ICALP’44, LNCS 820, pp.580–592 (1994).
J. Gill, “Computational complexity of probabilistic Turing machine”, SIAM J.CO MPUT., vol.6, no.4, pp.675–695 (1977).
G. Hardy and E. Wright, “An Introduction to the Theory of Numbers”, 5th ed. Oxford University Press (1979).
M. Liskiewicz, “Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes”, Proceedings of STACS797, LNCS 1200, pp.129–140 (1997).
I.I. Macarie and M. Ogihara, “Properties of probabilistic pushdown automata”, Theoretical Computer Science, vol.207, pp.117–130 (1998).
T. Okazaki, K. Inoue, A. Ito and Y. Wang, “A note on two-dimensional probabilistic Turing machines”, Information Sciences, vol.113, pp.205–220 (1999).
T. Okazaki, L. Zhang, K. Inoue, A. Ito and Y. Wang, “A note on two-dimensional probabilistic finite automata”, Information Sciences, vol.110, pp.303–314 (1999).
E. Seneta, “Non-Negative Matrices and Markov Chains”, 2nd Ed. Springer-Verlag, New York (1981).
A. Szepietowski, “Turing Machines with Sublogarithmic Space”, Lecture Notes in Compputer Science 843 (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sasaki, Y., Inoue, K., Ito, A., Wang, Y. (2003). A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-45005-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40431-6
Online ISBN: 978-3-540-45005-4
eBook Packages: Springer Book Archive