Reports

 

The Approximation of Probabilistic Turing Automata by Probabilistic Pushdown Automata ; CU-CS-020-73 Public Deposited

Downloadable Content

Download PDF
https://scholar.colorado.edu/concern/reports/st74cr315
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.
Creator
Date Issued
  • 1973-06-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items