Voir la notice de l'article provenant de la source Numdam
We give a bound for the -equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet.
@article{ITA_2003__37_2_149_0,
author = {Honkala, Juha},
title = {A bound for the $\sf \omega $-equivalence problem of polynomial {D0L} systems},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {149--157},
publisher = {EDP-Sciences},
volume = {37},
number = {2},
year = {2003},
doi = {10.1051/ita:2003015},
mrnumber = {2015689},
zbl = {1112.68394},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2003015/}
}
TY - JOUR AU - Honkala, Juha TI - A bound for the $\sf \omega $-equivalence problem of polynomial D0L systems JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2003 SP - 149 EP - 157 VL - 37 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2003015/ DO - 10.1051/ita:2003015 LA - en ID - ITA_2003__37_2_149_0 ER -
%0 Journal Article %A Honkala, Juha %T A bound for the $\sf \omega $-equivalence problem of polynomial D0L systems %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2003 %P 149-157 %V 37 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2003015/ %R 10.1051/ita:2003015 %G en %F ITA_2003__37_2_149_0
Honkala, Juha. A bound for the $\sf \omega $-equivalence problem of polynomial D0L systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 37 (2003) no. 2, pp. 149-157. doi: 10.1051/ita:2003015
Cité par Sources :