In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Hugo Gimbert, Youssouf Oualhadj
- ICALP
- 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

- Omid Madani, Steve Hanks, Anne Condon
- AAAI/IAAI
- 1999

We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decisionâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Christel Baier, Marta Z. Kwiatkowska
- Distributed Computing
- 1998

We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow nonâ€¦Â (More)

Is this relevant?

1998

1998

- Pierre Dupont, Lin Lawrence Chase
- ICGI
- 1998

In this paper we show that clustering alphabet symbols before PDFA inference is performed reduces perplexity on new data. Thisâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Dana Ron, Yoram Singer, Naftali Tishby
- Machine Learning
- 1996

We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can beâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Dana Ron, Yoram Singer, Naftali Tishby
- COLT
- 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

- Reinhard Kneser, Hermann Ney
- ICASSP
- 1995

Tn stochastic language modeling, backing-off is a widely used method to cope with the sparse data problem. In case of unseenâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Hermann Ney, Ute Essen, Reinhard Kneser
- Computer Speech & Language
- 1994

Â

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Naoki Abe, Manfred K. Warmuth
- Machine Learning
- 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