Left-to-right regular languages and two-way restarting automata

E-ISSN： 1290-385x|43|3|653-665

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.3, 2009-04, pp. : 653-665

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

Translation from classical two-way automata to pebble two-way automata

By Geffert Viliam Ištoňová L'ubomíra

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 4, 2011-02 ,pp. : 507-523

Edp Sciences

Access to resources Recommend Favorite

Two-way representations and weighted automata

By Lombardy Sylvain

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

Edp Sciences

Access to resources Recommend Favorite

On the classes of languages accepted by limited context restarting automata∗∗∗∗∗∗

By Otto Friedrich Černo Peter Mráz František

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 61-84

Edp Sciences

Access to resources Recommend Favorite

Sequential monotonicity for restarting automata

By Jurdziński Tomasz Otto Friedrich

RAIRO - Theoretical Informatics and Applications, Vol. 41, Iss. 2, 2007-07 ,pp. : 157-175

Edp Sciences

Access to resources Recommend Favorite

Systems of parallel communicating restarting automata

By Vollweiler Marcel Otto Friedrich

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 3-22

Edp Sciences

Access to resources Recommend Favorite