The equivalence problem of polynomially bounded D0L systems - a bound depending only on the size of the alphabet

被引：11
|
作者：
Honkala, J [1 ]
机构：
[1] Univ Turku, Dept Math, FIN-20014 Turku, Finland
来源：
THEORY OF COMPUTING SYSTEMS | 2003年 / 36卷 / 01期
关键词：
Equivalence Problem; Initial Term; Distinct Letter; Arbitrary Morphism; Monoid Morphism;
D O I：
10.1007/s00224-002-1075-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give abound for the sequence equivalence problem of polynomially bounded DOL systems which depends only on the size of the underlying alphabet.
引用
收藏
页码：89 / 103
页数：15
相关论文
共 28 条
123