×

zbMATH — the first resource for mathematics

Deterministic simulation of tape-bounded probabilistic Turing machine transducers. (English) Zbl 0442.68034

MSC:
68Q25 Analysis of algorithms and problem complexity
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68Q45 Formal languages and automata
PDF BibTeX Cite
Full Text: DOI
References:
[1] Csanky, L., Fast parallel matrix inversion algorithms, SIAM J. comput., 5, 618-623, (1976) · Zbl 0353.68063
[2] Gill, J., Computational complexity of probabilistic Turing machines, SIAM J. comput., 6, 675-695, (1977) · Zbl 0366.02024
[3] Hartmanis, J.; Simon, J., On the power of multiplication in random access machines, Proc. 15th IEEE symposium on switching and automata theory, 12-23, (1974)
[4] Hopcroft, J.E.; Ullman, J.D., Formal languages and their relation to automata, (1969), Addison-Wesley Reading, MA · Zbl 0196.01701
[5] Hunt, J.W., Topics in probabilistic complexity, ()
[6] Pratt, V.R.; Stockmeyer, L.J., A characterization of the power of vector machines, J. comput. systems sci., 12, 198-221, (1976) · Zbl 0342.68033
[7] J. Simon, On tape-bounded probabilistic computations, Theoret. Comput. Sci., to appear. · Zbl 0473.68044
[8] Simon, J.; Gill, J.; Hunt, J., On tape-bounded probabilistic Turing machine transducers, Proc. 19th symposium on the foundations of computer science, 107-112, (1978)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.