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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
We discuss the concept of probabilistic shaping (PS) of constellations, and show that PS allows for flexibly tunable spectral… 
2012
2012
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the… 
2010
2010
A guidance document has been developed as part of a four-year Nordic project dealing with the use of probabilistic safety… 
2008
2008
An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view… 
2008
2008
This paper proposes a probabilistic description logic that combines (i) constructs of the well-known ALC logic, (ii… 
2008
2008
In this paper, we present a report on the research and development of speech to speech translation system for Asian languages… 
2007
2007
The Dempster-ShaferTheory of Evidence (DST) has been considered as an alternative to prob- abilistic modelling if both a large… 
1999
1999
An enhanced fatigue life management process for aircraft turbine engine rotors based on probabilistic damage tolerance methods is… 
1992
1992
  • V. K. Garg
  • 1992
  • Corpus ID: 122067797
The author defines probabilistic languages and probabilistic automata over a finite set of events. Operators under which the set… 
1989
1989
The paper describes a concept for object location, when not only image features but also the model description is uncertain. It…