Sciweavers

391 search results - page 23 / 79
» Compositionality for Probabilistic Automata
Sort
View
ALT
2010
Springer
13 years 10 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
CORR
2010
Springer
55views Education» more  CORR 2010»
13 years 8 months ago
On Zone-Based Analysis of Duration Probabilistic Automata
Oded Maler, Kim G. Larsen, Bruce H. Krogh