An upper bound for transforming self-verifying automata into deterministic ones

E-ISSN： 1290-385x|41|3|261-265

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.41, Iss.3, 2007-09, pp. : 261-265

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

A Lower Bound For Reversible Automata

By Héam Pierre-Cyrille

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 5, 2010-03 ,pp. : 331-341

Edp Sciences

Access to resources Recommend Favorite

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

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

An Upper Bound on the Space Complexity of Random Formulae in Resolution

By Zito Michele

RAIRO - Theoretical Informatics and Applications, Vol. 36, Iss. 4, 2010-03 ,pp. : 329-339

Edp Sciences

Access to resources Recommend Favorite

An upper bound on the complexity of recognizable tree languages

By Finkel Olivier Lecomte Dominique Simonnet Pierre

RAIRO - Theoretical Informatics and Applications, Vol. 49, Iss. 2, 2015-07 ,pp. : 121-137

Edp Sciences

Access to resources Recommend Favorite