1 / 5

Probabilistic and Frequency Finite-State Transducers

Probabilistic and Frequency Finite-State Transducers. Kaspars Balodis Anda Berina Gleb Borovitsky Rusins Freivalds Ginta Garkaje Vladimirs Kacs Janis Kalejs Ilja Kucevalovs Janis Rocans Madars Virza. Probabilistic transducers.

shanta
Télécharger la présentation

Probabilistic and Frequency Finite-State Transducers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Probabilistic and Frequency Finite-StateTransducers Kaspars Balodis Anda Berina Gleb Borovitsky Rusins Freivalds Ginta Garkaje Vladimirs Kacs Janis Kalejs Ilja Kucevalovs Janis Rocans Madars Virza

  2. Probabilistic transducers • We explore so-called Las Vegas transducers, which give a false answer with probability 0, • and prove theorems, such as if any Las Vegas transducer can compute a relation with probability greater than ½, then this relation can be computed with a deterministic transducer.

  3. Deterministic transducers with help symbols • We observe deterministic transducers where one or more added help symbols are viewable at any time during the computation of a relation, • and compare these with Las Vegas transducers, proving that, for example, if you need n help symbols to compute a relation, a Las Vegas transducer can compute this relation with probability 1/n,

  4. Frequency transducers • A frequency transducer is a transducer, which has n input tapes with unique inputs and n output tapes, that (m,n)-calculates a relation on all the tapes in a way, that at least m out of the n output tapes produce a correct result.

  5. Thank you for your attention

More Related