Search for Author All Reviews
	Kiefer, Stefan     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Efficient analysis of probabilistic programs with an unbounded counter Brázdil T., Kiefer S., Kŭcera A. Journal of the ACM 61(6): 1-35, 2014.  Type: Article The authors consider a probabilistic recursive program working on data of unbounded size, for example, with a geometric probability distribution for what the data looks like. This makes sense for common data structures like trees. Is t...... Mar 30 2015     Language equivalence of probabilistic pushdown automata Forejt V., Jančar P., Kiefer S., Worrell J. Information and Computation 2371-11, 2014.  Type: Article A probabilistic pushdown automaton (PDA) maps a state and a letter on top of the pushdown stack to a probability distribution over states and stack actions (pushes and pops). Thus, it lies between a deterministic and a nondeterministic...... Jan 26 2015     Parikh’s theorem: a simple and direct automaton construction Esparza J., Ganty P., Kiefer S., Luttenberger M. Information Processing Letters 111(12): 614-619, 2011.  Type: Article As the title promises, the construction given by the authors is, indeed, quite simple and direct. For any context-free grammar G, their method can be easily applied to “construct a nondeterministic finite a...... Oct 31 2011
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy