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

D0L sequence equivalence is in P for fixed alphabets

By Ruohonen Keijo  

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 2, 2007-12 ,pp. : 361-374

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

Regularity of languages defined by formal series with isolated cut point∗

By Bertoni Alberto   Bianchi Maria Paola   D’Alessandro Flavi  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 4, 2012-11 ,pp. : 479-493

Edp Sciences

Access to resources Recommend Favorite

Measurement of the ${D^0} - {\mathop D\limits^ ^0}$ mixing at CDF

By  

EPJ Web of Conference, Vol. 60, Iss. issue, 2013-11 ,pp. : 15014-15014

Edp Sciences

Access to resources Recommend Favorite