Undecidability of the equivalence of finite substitutions on regular language

E-ISSN： 1290-385x|33|2|117-124

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.33, Iss.2, 2010-03, pp. : 117-124

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 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

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

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations

By Finkel Olivier

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 2, 2010-03 ,pp. : 115-126

Edp Sciences

Access to resources Recommend Favorite

Undecidability of infinite post correspondence problem for instances of Size 9

By Halava Vesa Harju Tero

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 4, 2006-11 ,pp. : 551-557

Edp Sciences

Access to resources Recommend Favorite

Undecidability of infinite post correspondence problem for instances of size 8

By Dong Jing Liu Qinghui

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 3, 2012-08 ,pp. : 451-457

Edp Sciences

Access to resources Recommend Favorite