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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2016
0204019632016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decision… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow non… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1998
1998
In this paper we show that clustering alphabet symbols before PDFA inference is performed reduces perplexity on new data. This… (More)
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 5
  • figure B.1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We propose and analyze a distribution learning algorithm for a subclass of acyclic probalistic finite automata (APFA). This… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Tn stochastic language modeling, backing-off is a widely used method to cope with the sparse data problem. In case of unseen… (More)
  • table 2
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1990
Highly Cited
1990
We introduce a rigorous performance criterion for training algorithms for probabilistic automata (PAs) and hidden Markov models… (More)
Is this relevant?
Highly Cited
1963
Highly Cited
1963
 
  • figure 1
Is this relevant?