Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Probabilistic automaton

Known as: Probabilistic finite automata, Stochastic language, Probabilistic automata 
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Knowledge is indispensable to understanding. The ongoing information explosion highlights the need to enable machines to better… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension… Expand
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Modern models of relation extraction for tasks like ACE are based on supervised learning of relations from small hand-labeled… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper, a framework for maximum a posteriori (MAP) estimation of hidden Markov models (HMM) is presented. Three key issues… Expand
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Abstract In this paper, we study the problem of stochastic language modelling from the viewpoint of introducing suitable… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present a new algorithm for finding a maximum matching in a general graph. The special feature of our algorithm is that its… Expand
Is this relevant?