Author： Kärki Tomi
Publisher： Edp Sciences
E-ISSN： 1290-385x|42|3|539-552
ISSN： 0988-3754
Source： RAIRO - Theoretical Informatics and Applications, Vol.42, Iss.3, 2008-06, pp. : 539-552
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Unambiguous erasing morphisms in free monoids
RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 2, 2010-05 ,pp. :
Access to resources
Recommend
Finite Completion of comma-free codes Part 2
RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 2, 2010-03 ,pp. :
Finite Completion of comma-free codes Part 1
RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 2, 2010-03 ,pp. :
On graph products of automatic monoids
RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 5, 2010-03 ,pp. :
The finiteness problem for monoids of morphisms
By Honkala Juha
RAIRO - Theoretical Informatics and Applications, Vol. 49, Iss. 1, 2015-03 ,pp. :