scientific article
From MaRDI portal
Publication:3919111
zbMath0466.68073MaRDI QIDQ3919111
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computing the relative entropy between regular tree languages, The Generative Power of Probabilistic and Weighted Context-Free Grammars, Variational Bayes via propositionalized probability computation in PRISM, Probabilistic hyperedge replacement grammars, A note on the expressive power of probabilistic context free grammars, Computation of moments for probabilistic finite-state automata, Consistency of stochastic context-free grammars, Learning Rational Stochastic Tree Languages, \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition, Birthday paradox, coupon collectors, caching algorithms and self- organizing search, Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms, A probabilistic model of computing with words, New Advances in Logic-Based Probabilistic Modeling by PRISM, CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS, CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS, Efficient coding of formalized messages, Logic-Based Probabilistic Modeling, Maximum likelihood analysis of algorithms and data structures, Derived linear systems of context-free grammars
