The finiteness of synchronous, tabled picture languages is decidable

被引：0
|
作者：
Truthe, Bianca [1 ]
机构：
[1] Univ Magdeburg, Fak Informat, D-39016 Magdeburg, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2006年 / 366卷 / 03期
关键词：
chain code picture systems; lindenmayer systems; finiteness; decidability;
D O I：
10.1016/j.tcs.2006.08.028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sTOL system) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether or not an sTOL system generates a finite picture language. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：297 / 315
页数：19
相关论文
共 50 条
12345