Decidability of the HD0L ultimate periodicity problem

E-ISSN： 1290-385x|47|2|201-214

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.47, Iss.2, 2013-05, pp. : 201-214

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

On the Decidability of the Equivalence Problem for Monadic RecursivePrograms

By Zakharov Vladimir A.

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 2, 2010-03 ,pp. : 157-171

Edp Sciences

Access to resources Recommend Favorite

A bound for the ω-equivalence problem of polynomial D0L systems

By Honkala Juha

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

Edp Sciences

Access to resources Recommend Favorite

Periodicity Problem of Substitutions over TernaryAlphabets

By Tan Bo Wen Zhi-Ying

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 4, 2010-03 ,pp. : 747-762

Edp Sciences

Access to resources Recommend Favorite

On the D0L Repetition Threshold

By Goldstein Ilya

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 3, 2010-10 ,pp. : 281-292

Edp Sciences

Access to resources Recommend Favorite

“THE ULTIMATE CHALLENGE FOR TECHNOLOGY: 0.02 MG/L EFFLUENT TOTAL PHOSPHORUS”

By Hook Gerald Ott Randy

Proceedings of the Water Environment Federation, Vol. 2001, Iss. 12, 2001-01 ,pp. : 113-132

Water Environment Federation

Access to resources Recommend Favorite