A Lower Bound For Reversible Automata

Author： Héam Pierre-Cyrille  

Publisher： Edp Sciences

E-ISSN： 1290-385x|34|5|331-341

ISSN： 0988-3754

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

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

Universality of Reversible Hexagonal Cellular Automata

By Morita Kenichi   Margenstern Maurice   Imai Katsunobu  

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 6, 2010-03 ,pp. : 535-550

Edp Sciences

Access to resources Recommend Favorite

Number-Conserving Reversible Cellular Automata and Their Computation-Universality

By Morita Kenichi   Imai Katsunobu  

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 3, 2010-03 ,pp. : 239-258

Edp Sciences

Access to resources Recommend Favorite

Lower Bounds for Las Vegas Automata by Information Theory

By Hirvensalo Mika   Seibert Sebastian  

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 1, 2010-03 ,pp. : 39-49

Edp Sciences

Access to resources Recommend Favorite

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

By Assent Ira   Seibert Sebastian  

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

Edp Sciences

Access to resources Recommend Favorite

A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines

By Geffert Viliam   Popély Norbert  

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

Edp Sciences

Access to resources Recommend Favorite