Author： Abe N.
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.9, Iss.2-3, 1992-07, pp. : 205-260
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the Computational Complexity of P Automata
By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György
Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. :
Access to resources
Recommend
Properties of probabilistic pushdown automata
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
On probabilistic timed automata
By Beauquier D.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
By Kreinovich Vladik Xiang Gang Starks Scott Longpré Luc Ceberio Martine Araiza Roberto Beck Jan Kandathi Raj Nayak Asis Torres Roberto Hajagos Janos
Reliable Computing, Vol. 12, Iss. 6, 2006-12 ,pp. :