This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Probabilistic Automata with Monitored Final State Sets
April 1971 (vol. 20 no. 4)
pp. 448-452
Probabilistic automata with time-variant final state sets monitored, in an intuitive manner, by autonomous probabilistic automata are considered. It is shown that they include a scheme suggested by Turakainen as a particular case, and that they accept all the stochastic languages. If the monitors are started in stationary distributions, it is proved that such schemes will accept all and only the stochastic languages; other cases in which the languages can be shown to be stochastic follow, including the case in which the state transition matrix of the monitor is deterministic.
Index Terms:
Formal languages, monitored automata, probabilistic automata, stochastic languages.
Citation:
C. De Renna E Souza, "Probabilistic Automata with Monitored Final State Sets," IEEE Transactions on Computers, vol. 20, no. 4, pp. 448-452, April 1971, doi:10.1109/T-C.1971.223262
Usage of this product signifies your acceptance of the Terms of Use.