Equivalence problem of D0L and DF0L power series

被引：0

|

作者：

Honkala, Juha

机构：

来源：

Fundamenta Informaticae | 1999年 / 38卷 / 1-2期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：201 / 208

相关论文

共 50 条

[21] The equivalence problem of polynomially bounded D0L systems - a bound depending only on the size of the alphabet
Honkala, J
THEORY OF COMPUTING SYSTEMS, 2003, 36 (01) : 89 - 103
[22] The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet
Juha Honkala
Theory of Computing Systems, 2003, 36 : 89 - 103
[23] 模糊D0L幂级数
师瑕娟
李永明
模糊系统与数学, 2015, 29 (01) : 25 - 30
[24] D0L Sequences and their Equality Sets
Honkala, Juha
FUNDAMENTA INFORMATICAE, 2017, 154 (1-4) : 201 - 206
[25] The power of networks of Watson-Crick D0L systems
Csuhaj-Varjú, E
Salomaa, A
ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 106 - 118
[26] Equality sets of binary D0L sequences
Honkala, Juha
THEORETICAL COMPUTER SCIENCE, 2018, 740 : 63 - 67
[27] Results concerning thinness of D0L languages
Honkala, J
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2000, 10 (02) : 209 - 216
[28] A NOTE ON THE COMPLEXITY OF GENERAL D0L MEMBERSHIP
JONES, ND
SKYUM, S
SIAM JOURNAL ON COMPUTING, 1981, 10 (01) : 114 - 117
[29] Watson-Crick D0L systems:: The power of one transition
Salomaa, A
Sosík, P
THEORETICAL COMPUTER SCIENCE, 2003, 301 (1-3) : 187 - 200
[30] PERIODICITY AND ULTIMATE PERIODICITY OF D0L SYSTEMS
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1991, 82 (01) : 19 - 33

← 1 2 3 4 5 →