Distribution functions of probabilistic automata

DOI10.1145/380752.380872MaRDI QIDQ5176027zbMATH OpenOpenAlexFDO

Authors Farrokh Vatan

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/380752.380872

zbMATH Keywords

denotational semanticsdynamical systemsprobabilistic automata

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• On distributions computable by random walks on graphs
• On Distributions Computable by Random Walks on Graphs
• scientific article; zbMATH DE number 4098724
• scientific article; zbMATH DE number 3222931
• scientific article; zbMATH DE number 3856433

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(7)

• Rational probability measures
• On the computational complexity of approximating distributions by probabilistic automata
• Probabilistic automata for computing with words
• scientific article; zbMATH DE number 3856416 (Why is no real title available?)
• On Distributions Computable by Random Walks on Graphs
• scientific article; zbMATH DE number 3999301 (Why is no real title available?)
• On distributions computable by random walks on graphs

This page was built for publication: Distribution functions of probabilistic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176027)