Abstract
Given a description of a probabilistic automaton (one-head probabilistic finite automaton or probabilistic Turing machine) and an input string x of length n, we ask how much space does a deterministic Turing machine need in order to decide the acceptance of an input string by that automaton?
The question is interesting even in the case of one-head one-way probabilistic finite automata. We call (rational) stochastic languages (S >rat ) the class of languages recognized by these devices with rational transition probabilities and rational cutpoint. Our main results are as follows:
-
The (proper) inclusion of (S >rat ) in Dspace(logn), which is optimal (i.e. (S >rat ) ⪵ Dspace(o(logn))). The previous upper bounds were Dspace(n) [Dieu 1972], [Wang 1992] and Dspace(log n log log n) [Jung 1984].
-
The inclusion of the languages recognized by S(n) ε O(logn) spacebounded probabilistic Turing machines in Dspace(min(2S(n) logn, logn(S(n)+ loglogn))). The previous upper bound was Dspace(logn(S(n)+log logn)) [Jung 1984].
Of independent interest is our technique to compare numbers given in terms of their values modulo a sequence of primes, p 1 < p 2 <⋯ < p n it= O(na) (where a is some constant) in O(log n) deterministic space.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Borodin, A. On relating time and space to size and depth. SIAM J. Comput. 6, 1977, pp. 733–744.
Bukharaev R. On the representability of events in probabilistic automata. Prob. methods and Cybernetics, V, Kazan, 1967, pp. 7–20 (in Russian).
Davida, G.I., and Litow, B. Fast parallel arithmetic via modular representation. SIAM J. Comput. 20, 1991, pp. 756–765.
Dietz, P. Personal communication. April 1993.
Dietz, P., Macarie, I., and Seiferas, J. Bits and Relative Order from Residues, Space Efficiently. TR 464, July 1993, Dept. of Computer Science, Univ. of Rochester.
Dieu, P.D. On a Class of Stochastic Languages. Zietschr. f. math. Logik und Grundlagen d. Math. 17, 1971, pp. 421–425.
Dieu, P.D. On a Necessary Condition for Stochastic Languages. Electronische Informationsverarbeitung und Kybernetik EIK 8, 10, 1972, pp. 575–588.
Dwork, C. and Stockmeyer, L. A time complexity gap for two-way Probabilistic Finite-state Automata. Siam J. Comput. Vol. 19, No. 6, pp 1011–1023, December 1990.
Freivalds, R. Probabilistic two-way machines. Proceedings, Int. Sympos. Math. Found. of Comput. Sci., Lecture Notes in Computer Science Vol. 118, Springer, 1981, pp. 33–45.
Gill, J. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, No 4, 1977, pp. 675–695.
Golub, G., and Van Loan, C. Matrix Computations. The Johns Hopkins University Press, Baltimore, Maryland, 1983.
Jung, H. On probabilistic tape complexity and fast circuits for matrix inversion problems. Proc. ICALP 1984, LNCS 172, pp. 281–291.
Kaneps, J. Stochasticity of the languages recognizable by 2-way finite probabilistic automata. Diskretnaya Matematika, Vol. 1, No 4, 1989, pp. 63–77 (Russian).
Lewis II, P.M., Stearn, R., and Hartmanis, J. Memory bounds for recognition of context-free and context-sensitive languages. IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 191–202.
Macarie, I. Closure properties of stochastic languages. TR441, Jan 1993, Dept. of Comp. Science, Univ. of Rochester
Monien, B. and Sudborough I. H. On eliminating nondeterminism from Turing machines which use less than logarithm worktape space. Theoretical Computer Science 21, 1982, pp. 237–253.
Rabin, M.O. Probabilistic automata. Information and control, 6, 1963, pp. 230–244.
Reif, J. Logarithmic depth circuits for algebraic functions. SIAM J. Cornput., 15, No 1, 1986, pp. 231–242.
Ravikumar, B. Some Observations on 2-way Probabilistic Finite Automata. TR92-208, May 1992, Dept. of Comp. Science and Statistics, Univ. of Rhode Island.
Ruzzo, W., Simon, J.,and Tompa, M. Space-bounded hierarchies and probabilistic computation. 14th Annual ACM Symposium on Theory of Computing, 1982, pp. 215–223.
Simon, J. On the difference between one and many. 4th Coll. on Automata,Languages and Programming, 1977, LNCS 52, pp. 480–491.
Sipser, M. Halting space-bounded Computation. Theoretical Computer Science 10, 1980, pp. 335–338.
Starke, P. Stochastische Ereignisse und Wortmengen. Zietschr. f. math. Logik und Grundlagen d. Math. 12, 1966, pp. 61–68.
Stone, H. An efficient parallel algorithm for the solution of a tridiagonal linear system of equations. JACM 20, No 1, 1973, pp. 27–38.
Turakainen, P. On Stochastic Languages. Information and Control 12, 1968, pp. 304–313.
Turakainen, P. On languages representable in rational probabilistic automata. Ann. Acad. Sci. Fenn. Ser. A I 439, 1969.
Turakainen, P. Generalized automata and stochastic languages. Proc. Amer. Math. Soc. 21, 1969, pp. 303–309.
Wang, J. A note on two-way probabilistic automata. IPL 43, 1992, pp. 321–326.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Macarie, I.I. (1994). Space-efficient deterministic simulation of probabilistic automata. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_135
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive