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

Author： Mereghetti Carlo   Palano Beatrice   Pighizzini Giovanni  

Publisher： Edp Sciences

E-ISSN： 1290-385x|35|5|477-490

ISSN： 0988-3754

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

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

Hyper-minimizing minimized deterministic finite state automata

By Badr Andrew   Geffert Viliam   Shipman Ian  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 1, 2007-12 ,pp. : 69-94

Edp Sciences

Access to resources Recommend Favorite

Quantum finite automata with control language

By Mereghetti Carlo   Palano Beatrice  

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 2, 2006-07 ,pp. : 315-332

Edp Sciences

Access to resources Recommend Favorite

On the state complexity of semi-quantum finite automata⋆⋆⋆

By Zheng Shenggen   Gruska Jozef   Qiu Daowen  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 2, 2014-05 ,pp. : 187-207

Edp Sciences

Access to resources Recommend Favorite

A Finite Axiomatization of Nondeterministic Regular Expressions

By Corradini Flavio   De Nicola Rocco   Labella Anna  

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 4-5, 2010-03 ,pp. : 447-465

Edp Sciences

Access to resources Recommend Favorite

On the Size of One-way Quantum Finite Automata with Periodic Behaviors

By Mereghetti Carlo   Palano Beatrice  

RAIRO - Theoretical Informatics and Applications, Vol. 36, Iss. 3, 2010-03 ,pp. : 277-291

Edp Sciences

Access to resources Recommend Favorite