Normal forms for unary probabilistic automata

Author： Bianchi Maria Paola   Pighizzini Giovanni  

Publisher： Edp Sciences

E-ISSN： 1290-385x|46|4|495-510

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.46, Iss.4, 2012-11, pp. : 495-510

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata

By Mereghetti Carlo   Palano Beatrice   Pighizzini Giovanni  

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 5, 2010-03 ,pp. : 477-490

Edp Sciences

Access to resources Recommend Favorite

Modeling of Power Consumption of the Mining Equipment Using “The Probabilistic Automata Method”

By  

E3S Web of conferences, Vol. 15, Iss. issue, 2017-04 ,pp. : 03001-03001

Edp Sciences

Access to resources Recommend Favorite

Tree Automata and Automata on Linear Orderings

By Bruyère Véronique   Carton Olivier   Sénizergues Géraud  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2009-04 ,pp. : 321-338

Edp Sciences

Access to resources Recommend Favorite

Input- or output-unary sweeping transducers are weaker than their 2-way counterparts

By Guillon Bruno  

RAIRO - Theoretical Informatics and Applications, Vol. 50, Iss. 4, 2017-02 ,pp. : 275-294

Edp Sciences

Access to resources Recommend Favorite

k-counting automata

By Allred Joël   Ultes-Nitsche Ulrich  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 4, 2012-11 ,pp. : 461-478

Edp Sciences

Access to resources Recommend Favorite