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 条
  • [1] A method for deciding the finiteness of deterministic tabled picture languages
    Truthe, B
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 406 - 417
  • [2] On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems
    Truthe, Bianca
    ACTA CYBERNETICA, 2005, 17 (01): : 53 - 73
  • [3] On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems
    Muthe, B
    FUNDAMENTA INFORMATICAE, 2003, 56 (04) : 389 - 409
  • [4] Finiteness of Chain-code Picture Languages on the Triangular Grid
    Balint, Gergely T.
    Nagy, Benedek
    ISPA 2015 9TH INTERNATIONAL SYMPOSIUM ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS, 2015, : 310 - 315
  • [5] FINITENESS OF SEMIGROUP LINEAR REPRESENTATIONS IS DECIDABLE
    JACOB, G
    JOURNAL OF ALGEBRA, 1978, 52 (02) : 437 - 459
  • [6] Learning Languages with Decidable Hypotheses
    Berger, Julian
    Bother, Maximilian
    Doskoc, Vanja
    Harder, Jonathan Gadea
    Klodt, Nicolas
    Kotzing, Timo
    Lotzsch, Winfried
    Peters, Jannik
    Schiller, Leon
    Seifert, Lars
    Wells, Armin
    Wietheger, Simon
    CONNECTING WITH COMPUTABILITY, 2021, 12813 : 25 - 37
  • [7] WQO is decidable for factorial languages
    Atminas, Aistis
    Lozin, Vadim
    Moshkov, Mikhail
    INFORMATION AND COMPUTATION, 2017, 256 : 321 - 333
  • [8] Decidable hierarchies of starfree languages
    Glasser, C
    Schmitz, H
    FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 503 - 515
  • [9] Decidable Logic in the Design of Functional Languages
    Huang, Hao
    Long, Huan
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 261 - 265
  • [10] THE EQUIVALENCE PROBLEM FOR NTS LANGUAGES IS DECIDABLE
    SENIZERGUES, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1982, 145 : 313 - 323
12345