Document Type

Technical Report

Publication Date

Summer 6-1-1973

Abstract

The concepts of Probabilistic Pushdown Automata and Probabilistic Turing Automata are defined. Then an algorithm is proposed which allows one to approximate the Turing Automation by the Pushdown Automation. The goodness of fit of this approximation is investigated, and an error bound is derived.

Share

COinS