Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Computer scienceConstraint automatonCurryingFormal language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Multi-level Unified Caches for Probabilistically Time Analysable Real-Time Systems
Caches are key resources in high-end processor architectures to increase performance. In fact, most high-performance processors… 
2007
2007
Reliability conducive measures of coherence
A measure of coherence is said to be truth conducive if and only if a higher degree of coherence (as measured) results in a… 
2006
2006
Stochastic Language Generation Using WIDL-Expressions and its Application in Machine Translation and Summarization
We propose WIDL-expressions as a flexible formalism that facilitates the integration of a generic sentence realization system… 
2005
2005
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary… 
Highly Cited
2000
Highly Cited
2000
Stochastic language adaptation over time and state in natural spoken dialog systems
We are interested in adaptive spoken dialog systems for automated services. Peoples' spoken language usage varies over time for a… 
1995
1995
Forward-backward retraining of recurrent neural networks
This paper describes the training of a recurrent neural network as the letter posterior probability estimator for a hidden Markov… 
1992
1992
Improvements in Stochastic Language Modeling
We describe two attempt to improve our stochastic language models. In the first, we identify a systematic overestimation in the… 
1990
1990
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines
Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an… 
1986
1986
On compatibility and support functions in probabilistic relaxation
Highly Cited
1973
Highly Cited
1973
Testing for Intermittent Faults in Digital Circuits
In this paper we present a few fundamental results related to the problems of characterization and detection of intermittent… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)